Better algorithms for high-dimensional proximity problems via asymmetric embeddings

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 539-545

  Indyk, Piotr ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; INVERSE PROBLEMS; MATHEMATICAL MODELS; NORMAL DISTRIBUTION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING; VECTORS;

ASYMMETRIC EMBEDDINGS; NEAREST NEIGHBOR ALGORITHM;

ALGORITHMS;

EID: 0038754101     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. P.K. Agarwal, A. Gionis, L. Guibas, and R. Motwani. Rank-based similarity searching. Manuscript, 1998.
2. P.K. Agarwal, J. Matoušek, and S. Suri. Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Computational Geometry: Theory and Applications, 1(4):189-201, 1992.
3. R. I. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random projection. Proceedings of the Symposium on Foundations of Computer Science, 1999.
4. A. Borodin, R. Ostrovsky, and Y. Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. Proceedings of the Symposium on Theory of Computing, 1999.
5. A. Borodin, R. Ostrovsky, and Y. Rabani. Subquadratic approximation algorithms for clustering problems in high dimensional spaces. Proceedings of the Symposium on Theory of Computing, 1999.
6. S. Dasgupta. Learning mixtures of gaussians. Proceedings of the Symposium on Foundations of Computer Science, pages 634-644, 1999.
7. O. Egecioglu and B. Kalantari. Approximating the diameter of a set of points in the euclidean space. Information Processing Letters, 32:205, 1989.
8. D. Eppstein. Dynamic euclidean minimum spanning trees and extrema of binary functions. Disc. Comp. Geom., 13: 111-122, 1995.
9. R. Fagin. Combining fuzzy information from multiple systems. Proceedings of the ACM Symposium on Principles of Database Systems, pages 216-227, 1996.
10. R. Fagin. Fuzzy queries in multimedia database systems (invited paper). Proceedings of the ACM Symposium on Principles of Database Systems, 1998.
11. M. Farach-Colton and P. Indyk. Approximate nearest neighbor algorithms for hausdorff metrics via embeddings. Proceedings of the Symposium on Foundations of Computer Science, 1999.
12. W. Feller. An Introduction to Probability Theory and its Applications. John Wiley & Sons, NY, 1991.
13. D. Finocchiaro and M. Pellegrini. On computing the diameter of a point set in high dimensional euclidean space. Proceedings of the European Symposium on Algorithms, 1999.
14. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. Proceedings of the Symposium on Theory of Computing, pages 135-143, 1984.
15. A. Goel, P. Indyk, and K. Varadarajan. Reductions among high-dimensional geometric problems. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2001.
16. P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proceedings of the Symposium on Theory of Computing, 1998.
17. ∞ norm. Journal of Computer and System Sciences, to appear. Preliminary version appeared in Proceedings of the Symposium on Foundations of Computer Science, 1988.
18. P. Indyk. Dimensionality reduction techniques for proximity problems. Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, 2000.
19. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proceedings of the Symposium on Foundations of Computer Science, 2000.
20. P. Indyk. Approximate nearest neighbor algorithms for frechet metric via product metrics. Symposium on Computational Geometry, 2002.
21. n. Acta Mathematica, 149:71-85, 1982.
22. J. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computating, 1997.
23. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proceedings of the Thirtieth ACM Symposium on Theory of Computing, pages 614-623, 1998.
24. J. Lindenstrauss and V.D. Milman. Local theory of normed spaces and convexity. Handbook of convex geometry, B:1149-1220.
25. J. Matoušek. On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics, 93:333-344, 1996.
26. S. Muthukrishnan and C. Sahinalp. Approximate sequence nearest neighbors. Proceedings of the Symposium on Theory of Computing, 2000.