scientific article
From MaRDI portal
Publication:2913814
DOI10.4086/toc.2012.v008a002zbMath1278.68344OpenAlexW4253784538MaRDI QIDQ2913814
Sariel Har-Peled, Piotr Indyk, Rajeev Motwani
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (40)
Online machine learning techniques for Coq: a comparison ⋮ ANN for time series under the Fréchet distance ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Space exploration via proximity search ⋮ Exploiting pseudo-locality of interchange distance ⋮ Sparser Johnson-Lindenstrauss Transforms ⋮ Optimal (Euclidean) Metric Compression ⋮ Longest common substring with approximately \(k\) mismatches ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions ⋮ Fast Metric Embedding into the Hamming Cube ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Detecting the large entries of a sparse covariance matrix in sub-quadratic time ⋮ Robust proximity search for balls using sublinear space ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic ⋮ Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings ⋮ Unnamed Item ⋮ Lattice-based locality sensitive hashing is optimal ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Index structures for fast similarity search for binary vectors ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Index structures for fast similarity search for real vectors. II ⋮ Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ An efficient method for simulation of noisy coupled multi-dimensional oscillators ⋮ Privacy Preserving Query over Encrypted Multidimensional Massive Data in Cloud Storage ⋮ On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Unnamed Item ⋮ Hamming Distance Completeness ⋮ Unnamed Item ⋮ Approximating Minimization Diagrams and Generalized Proximity Search ⋮ Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) ⋮ Optimizing revenue while showing relevant assortments at scale
This page was built for publication:
