Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth 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 fixed dimensions
Journal of the ACM (JACM)
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
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Exact L∞ nearest neighbor search in high dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Approximate nearest neighbor algorithms for Frechet distance via product metrics
Proceedings of the eighteenth annual symposium on Computational geometry
Computational Discrete Mathematics
Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
ICDT '03 Proceedings of the 9th International Conference on Database Theory
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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
Cell-probe lower bounds for the partial match problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximate Nearest Neighbor under edit distance via product metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A note on point location in arrangements of hyperplanes
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
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences - Special issue: STOC 2003
Lower bounds for linear degeneracy testing
Journal of the ACM (JACM)
Entropy based nearest neighbor search in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient filtering with sketches in the ferret toolkit
MIR '06 Proceedings of the 8th ACM international workshop on Multimedia information retrieval
Sizing sketches: a rank-based analysis for similarity search
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Multi-probe LSH: efficient indexing for high-dimensional similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity
Approximating nearest neighbor among triangles in convex position
Information Processing Letters
Modeling LSH for performance tuning
Proceedings of the 17th ACM conference on Information and knowledge management
Approximate line nearest neighbor in high dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Adapting indexing trees to data distribution in feature spaces
Computer Vision and Image Understanding
Computing a closest point to a query hyperplane in three and higher dimensions
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Decision versus evaluation in algebraic complexity
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A comparison of nearest neighbor search algorithms for generic object recognition
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Approximate nearest neighbor search for low dimensional queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An efficient algorithm for the sign condition problem in the semi-algebraic context
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Efficient evaluation of specific queries in constraint databases
Information Processing Letters
An affine invariant k-nearest neighbor regression estimate
Journal of Multivariate Analysis
| Hi-index | 0.00 |