Approximate line nearest neighbor in high dimensions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 293-301

  Andoni, Alexandr ^a   Indyk, Piotr ^a   Krauthgamer, Robert ^b   Nguyen, Huy L ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

NEAREST NEIGHBOR SEARCH;

HIGH DIMENSIONS; LINEAR VARIATION; LOW DIMENSIONAL; MODEL DATA; NEAREST NEIGHBORS; PHYSICAL OBJECTS; POLYNOMIAL SPACE; SUB-LINEAR QUERIES;

QUERY PROCESSING;

EID: 70349132626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.33     Document Type: Conference Paper

References (8)

1. [BHZ07] Ronen Basri, Tal Hassner, and Lihi Zelnik-Manor. Approximate nearest subspace search with applications to pattern recognition. In Computer Vision and Pattern Recognition (CVPR'07), pages 1-8, June 2007.
2. [Cla88] K. Clarkson. A randomized algorithm for closest-point queries. SIAM Journal on Computing, 17:830-847, 1988.
3. [DG99] S. Dasgupta and A. Gupta. An elementary proof of the johnson-lindenstrauss lemma. ICSI technical report TR-99-1006, Berkeley, CA, 1999.
4. [HP01] S. Har-Peled. A replacement for voronoi diagrams of near linear size. In Proc of FOCS, pages 94-103, 2001.
5. [IM98] P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proc. of STOC, pages 604-613, 1998.
6. [KOR00] E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput, 30(2):457-474, 2000. Preliminary version appeared in STOC'98.
7. 2 that preserve volumes and distance to affine spaces. Discrete and Computational Geometry, 38(1):139-153, July 2007. Preliminary version appeared in RANDOM'02.
8. [Mei93] S. Meiser. Point location in arrangements of hyper-planes. Information and Computation, 106:286-303, 1993.