The following pages link to (Q2913814):
Displaying 40 items.
- Space exploration via proximity search (Q312150) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Index structures for fast similarity search for real vectors. II (Q722065) (← links)
- An efficient method for simulation of noisy coupled multi-dimensional oscillators (Q726999) (← links)
- ANN for time series under the Fréchet distance (Q832871) (← links)
- Robust proximity search for balls using sublinear space (Q1702130) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) (Q2110372) (← links)
- Optimizing revenue while showing relevant assortments at scale (Q2116864) (← links)
- Online machine learning techniques for Coq: a comparison (Q2128797) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q2196604) (← links)
- Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces (Q2282287) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Approximate nearest neighbor for curves: simple, efficient, and deterministic (Q2701391) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- (Q4558494) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- Privacy Preserving Query over Encrypted Multidimensional Massive Data in Cloud Storage (Q4690886) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- (Q5075744) (← links)
- Optimal (Euclidean) Metric Compression (Q5080486) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- (Q5115805) (← links)
- On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q5136267) (← links)
- (Q5140838) (← links)
- Approximating Minimization Diagrams and Generalized Proximity Search (Q5502175) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 (Q5875504) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
- On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions (Q6072195) (← links)
- (Q6124766) (← links)
- Fast Metric Embedding into the Hamming Cube (Q6154196) (← links)
