Toward Optimal ∈-Approximate Nearest Neighbor Algorithms

Journal of Algorithms

Volumn 41, Issue 2, 2001, Pages 417-428

  Cary, Matthew ^a  

^a University of Washington   (United States)

Author keywords

Approximation algorithms; Data structures; Nearest neighbor problem; Point location; Searching

Indexed keywords

EID: 0347156620     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1193     Document Type: Article

References (11)

1. A. Amir, A. Efrat, P. Indyk, and H. Samet, Efficient regular data structures and algorithms for location and proximity problems, in "Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, October 17-19, 1999," pp. 160-170.
2. A. Andersson, Faster deterministic sorting and searching in linear space, in "37th Annual Symposium on Foundations of Computer Science, Burlington, VT, October 14-16, 1996," pp. 135-141, IEEE Press, New York.
3. 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. Assoc. Comput. Mach. 45, No. 6 (1998), 891-923.
4. P. Beame and F. E. Fich, Optimal bounds for the predecessor problem, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, New York, May 1-4, 1999," pp. 295-304, Assoc. Comput. Mach., New York.
5. A. Borodin, R. Ostrovsky, and Y. Rabani, Lower bounds for high dimensional nearest neighbor search and related problems, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, New York, May 1-4, 1999," pp. 312-321, Assoc. Comput. Mach., New York.
6. A. Chakrabarti, B. Chazelle, B. Gum, and A. L. Vov, A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube, in "Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, New York, May 1-4, 1999," pp. 305-311, Assoc. Comput. Mach., New York.
7. M. L. Fredman and D. E. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47, No. 3 (1993), 424-436.
8. P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, in "Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), New York, May 23-26, 1998," pp. 604-613, Assoc. Comput. Mach., New York.
9. J. M. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, in "Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, TX, May 4-6, 1997," pp. 599-608.
10. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces, in "Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, TX, May 23-26, 1998," pp. 614-623.
11. P. Van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett. 6 (1977), 80-82.