Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Approximate closest-point queries in high dimensions
Information Processing Letters
Approximate nearest neighbor queries in fixed dimensions
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
Algorithms for Polytope Covering and Approximation
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
ACM Computing Surveys (CSUR)
Accounting for boundary effects in nearest neighbor searching
Proceedings of the eleventh annual symposium on Computational geometry
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
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
Effective nearest neighbors searching on the hyper-cube, with applications to molecular clustering
Proceedings of the fourteenth annual symposium on Computational geometry
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
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
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Expected-case complexity of approximate nearest neighbor searching
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Space-efficient approximate Voronoi diagrams
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Clustering for Approximate Similarity Search in High-Dimensional Spaces
IEEE Transactions on Knowledge and Data Engineering
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
An Empirical Study of a New Approach to Nearest Neighbor Searching
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
An Architecture of a Web-Based Collaborative Image Search Engine
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
Journal of Computer and System Sciences - Special issue on PODS 2000
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Mobile services discovery and selection in the publish/subscribe paradigm
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Building triangulations using ε-nets
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
Communications of the ACM
Safely selecting subsets of training data
DAS '10 Proceedings of the 9th IAPR International Workshop on Document Analysis Systems
Indexability, concentration, and VC theory
Proceedings of the Third International Conference on SImilarity Search and APplications
A unified approach to approximate proximity searching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Indexability, concentration, and VC theory
Journal of Discrete Algorithms
Feature match: an efficient low dimensional PatchMatch technique
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
The euclidean k-supplier problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.02 |
This paper gives an algorithm for approximately solving the post office problem: given n points (called sites) in d dimensions, build a data structure so that, given a query point q, a closest site to q can be found quickly. The algorithm is also given a relative error bound &egr;, and depends on a ratio &rgr;, which is no more than the ratio of the distance between the farthest pair of sites to the distance between the closest pair of sites. The algorithm builds a data structure of size O(n&eegr;)O(1/&egr;)(d−1)/2 in time O(n2&eegr;)O(1/&egr;)(d−1). Here &eegr;=log(&rgr;/&egr;). With this data structure, a site is returned whose distance to a query point q is within 1+&egr; of the distance of the closest site. A query needs O(logn)O(1/&egr;)(d−1)/2 time, with high probability.