A randomized algorithm for closest-point queries
SIAM Journal on Computing
Point location in arrangements of hyperplanes
Information and Computation
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 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
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Communication complexity of document exchange
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On approximate nearest neighbors under I norm
Journal of Computer and System Sciences
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Replacement for Voronoi Diagrams of Near Linear Size
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Nearest Neighbor under edit distance via product metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Entropy based nearest neighbor search in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fréchet distance for curves, revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Exact algorithms for partial curve matching via the Fréchet distance
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Overcoming the l1 non-embeddability barrier: algorithms for product metrics
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Filter selection and identification similarity using clustering under varying illumination
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Face recognition using correlation between illuminant context
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
| Hi-index | 0.00 |