Dimensionality reduction techniques for proximity problems

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

When crossings count — approximating the minimum spanning tree

Proceedings of the sixteenth annual symposium on Computational geometry

Time series similarity measures (tutorial PM-2)

Tutorial notes of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining

Reductions among high dimensional proximity problems

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Efficient and tumble similar set retrieval

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data

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

The nearest neighbor

Computational Discrete Mathematics

Better algorithms for high-dimensional proximity problems via asymmetric embeddings

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

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

Laplacian Eigenmaps for dimensionality reduction and data representation

Neural Computation

Think globally, fit locally: unsupervised learning of low dimensional manifolds

The Journal of Machine Learning Research

Approximate Nearest Neighbor under edit distance via product metrics

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

On the impossibility of dimension reduction in l1

Journal of the ACM (JACM)

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Stable distributions, pseudorandom generators, embeddings, and data stream computation

Journal of the ACM (JACM)

Uncertainty principles, extractors, and explicit embeddings of l2 into l1

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Tighter bounds for random projections of manifolds

Proceedings of the twenty-fourth annual symposium on Computational geometry

Faster dimension reduction

Communications of the ACM

Almost-Euclidean subspaces of l1Nvia tensor products: a simple approach to randomness reduction

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

An adaptive nearest neighbor classification algorithm for data streams

PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases

Multiple-Winners randomized tournaments with consensus for optimization problems in generic metric spaces

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

In-network approximate computation of outliers with quality guarantees

Information Systems