A randomized algorithm for closest-point queries
SIAM Journal on Computing
Ray shooting and parametric search
SIAM Journal on Computing
Point location in arrangements of hyperplanes
Information and Computation
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Linear-size approximate voronoi diagrams
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
SIAM Journal on Computing
A Replacement for Voronoi Diagrams of Near Linear Size
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A note on the nearest neighbor in growth-restricted metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
SIAM Journal on Computing
Lower bounds on locality sensitive hashing
Proceedings of the twenty-second annual symposium on Computational geometry
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Nearest-neighbor-preserving embeddings
ACM Transactions on Algorithms (TALG)
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
Geometric Approximation Algorithms
Geometric Approximation Algorithms
| Hi-index | 0.00 |
We study the Approximate Nearest Neighbor problem for metric spaces where the query points are constrained to lie on a subspace of low doubling dimension.