Finding nearest neighbors in growth-restricted metrics

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 741-750

  Karger, David R ^a   Ruhl, Matthias ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTERNET; LEARNING SYSTEMS; POLYNOMIALS; QUERY LANGUAGES; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; VECTOR QUANTIZATION;

GROWTH RESTRICTED METRICS; LOCAL SEARCH ALGORITHMS; NEAREST NEIGHBOR ALGORITHMS; PEER TO PEER NETWORKS;

DATA STRUCTURES;

EID: 0036040736     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/510008.510013     Document Type: Conference Paper

References (11)

1. Multidimensional binary search trees used for associative searching
2. Optimal expected-time algorithms for closest point problems
3. Near neighbor search in large metric spaces
4. Searching in metric spaces
5. Nearest neighbor queries in metric spaces
6. Accessing nearby copies of replicated objects in a distributed environment
7. Chord: A scalable peer-to-peer lookup service for internet applications
8. Mapping a manifold of perceptual observations
9. A global geometric framework for nonlinear dimensionality reduction
10. Satisfying general proximity/similarity queries with metric trees
11. Data structures and algorithms for nearest neighbor search in general metric spaces