Exact L∞ nearest neighbor search in high dimensions

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 157-163

  Alt, H ^a   Heinrich Litan, L ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PROBABILITY DISTRIBUTIONS; SET THEORY;

NEAREST NEIGHBOR PROBLEM;

PROBLEM SOLVING;

EID: 0034819582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378655     Document Type: Conference Paper

References (15)

1. Approximate nearest neighbor queries in fixed dimensions
2. Optimal expected time algorithms for closest point problems
3. A randomized algorithm for closest-point queries
4. Nearest neighbor methods in discrimination
5. Concentration of measure for the analysis of randomized algorithms
6. Multidimensional searching problems
7. Dimensionality reduction techniques for proximity problems
8. Approximate nearest neighbors: Towards removing the curse of dimensionality
9. Two algorithms for nearest-neighbor search in high dimension
10. Efficient search for approximate nearest neighbor in high dimensional spaces
11. Point location in arrangements of hyperplanes
12. Image databases and multi-media search