Information and Control
The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Syntactic clustering of the Web
Selected papers from the sixth international conference on World Wide Web
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Approximating matrix multiplication for pattern recognition tasks
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast hierarchical clustering and other applications of dynamic closest pairs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Performance Guarantees for Hierarchical Clustering
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Clustering in massive data sets
Handbook of massive data sets
Index Compression through Document Reordering
DCC '02 Proceedings of the Data Compression Conference
Efficient Biased Sampling for Approximate Clustering and Outlier Detection in Large Data Sets
IEEE Transactions on Knowledge and Data Engineering
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Performance guarantees for hierarchical clustering
Journal of Computer and System Sciences - Special issue on COLT 2002
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Towards a theory of intrusion detection
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Hi-index | 0.00 |