Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
STOC '98 Proceedings of the thirtieth 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
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved bandwidth approximation for trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Learning Mixtures of Gaussians
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Object Recognition as Many-to-Many Feature Matching
International Journal of Computer Vision
Embedding ultrametrics into low-dimensional spaces
Proceedings of the twenty-second annual symposium on Computational geometry
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Isotree: Tree clustering via metric embedding
Neurocomputing
Distortion lower bounds for line embeddings
Information Processing Letters
Many-to-Many Matching under the l1 Norm
ICIAP '09 Proceedings of the 15th International Conference on Image Analysis and Processing
Finding top-k similar pairs of objects annotated with terms from an ontology
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Indexing tree structures through caterpillar decomposition
SCIA'11 Proceedings of the 17th Scandinavian conference on Image analysis
Optimal distortion embedding of complete binary trees into lines
Information Processing Letters
| Hi-index | 0.01 |