Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)

A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition

IEEE Transactions on Pattern Analysis and Machine Intelligence

A randomized algorithm for closest-point queries

SIAM Journal on Computing

An O(n log n) algorithm for the all-nearest-neighbors problem

Discrete & Computational Geometry

Strategies for efficient incremental nearest neighbor search

Pattern Recognition

Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988

Introduction to statistical pattern recognition (2nd ed.)

Introduction to statistical pattern recognition (2nd ed.)

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)

An efficient approximation-elimination algorithm for fast nearest-neighbor search based on a spherical distance coordinate formulation

Pattern Recognition Letters

Separator based parallel divide and conquer in computational geometry

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Two algorithms for nearest-neighbor search in high dimensions

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Nearest neighbor queries in metric spaces

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Efficient search for approximate nearest neighbor in high dimensional spaces

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Lower bounds for high dimensional nearest neighbor search and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Data structures and algorithms for nearest neighbor search in general metric spaces

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

An optimal algorithm for approximate nearest neighbor searching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)

Data Structures for Range Searching

ACM Computing Surveys (CSUR)

Multidimensional divide-and-conquer

Communications of the ACM

The choice of reference points in best-match file searching

Communications of the ACM

Some approaches to best-match file searching

Communications of the ACM