Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation of protein structure for fast similarity measures
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Approximation of functions over redundant dictionaries using coherence
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Active Vertice method: a performant filtering approach to high-dimensional indexing
Data & Knowledge Engineering
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Dynamic algorithms for approximating interdistances
Nordic Journal of Computing
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Sparse approximations for high fidelity compression of network traffic data
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Approximate range searching in higher dimension
Computational Geometry: Theory and Applications
Linear-time approximation schemes for clustering problems in any dimensions
Journal of the ACM (JACM)
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Small space representations for metric min-sum k-clustering and their applications
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A database-based framework for gesture recognition
Personal and Ubiquitous Computing
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
BoostMap: a method for efficient approximate similarity rankings
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Property testing
Property testing
Linear time algorithms for clustering problems in any dimensions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Polylogarithmic private approximations and efficient matching
TCC'06 Proceedings of the Third conference on Theory of Cryptography
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |