Navigating nets: Simple algorithms for proximity search

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 791-800

  Krauthgamer, Robert ^a   Lee, James R ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA COMPRESSION; DATA MINING; DATABASE SYSTEMS; LEARNING SYSTEMS; PATTERN RECOGNITION; PROBLEM SOLVING; THEOREM PROVING;

NAVIGATING NETS; PROXIMITY SEARCH;

DATA STRUCTURES;

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

References (11)

1. +98] S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM, 45(6):891-923, 1998.
2. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
3. [Bri95] S. Brin. Near neighbor search in large metric spaces. In 21st International Conference on Very Large Data Bases, pages 574-584, 1995.
4. [Cla99] K. L. Clarkson. Nearest neighbor queries in metric spaces. Discrete Comput. Geom., 22(1):63-93, 1999.
5. [CNBYM01] E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273-321, September 2001.
6. [FK97] C. Faloutsos and I. Kamel. Relaxing the uniformity and independence assumptions using the concept of fractal dimension. J. Comput. System Sci., 55(2):229-240, 1997.
7. [GKL03] A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. Accepted to 43rd Symposium on Foundations of Computer Science, 2003.
8. [Hei01] J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, New York, 2001.
9. [IM98] P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In 30th Annual ACM Symposium on Theory of Computing, pages 604-613, May 1998.
10. [KOR98] E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high-dimensional spaces. In 30th Annual ACM Symposium on Theory of Computing, pages 614-623. ACM, 1998.
11. [KR02] D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In 34th Annual ACM Symposium on the Theory of Computing, pages 63-66, 2002.