Pages that link to "Item:Q1948601"
From MaRDI portal
The following pages link to A randomized approximate nearest neighbors algorithm (Q1948601):
Displaying 13 items.
- Detecting low-rank clusters via random sampling (Q425614) (← links)
- Index structures for fast similarity search for real vectors. II (Q722065) (← links)
- Probabilistic analysis of an algorithm for solving the \(k\)-dimensional all-nearest-neighbors problem by projection (Q1182607) (← links)
- Analysis of an adaptive algorithm to find the two nearest neighbors (Q1840513) (← links)
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds (Q2111184) (← links)
- Spatiotemporal pattern extraction by spectral analysis of vector-valued observables (Q2327837) (← links)
- A class of Laplacian multiwavelets bases for high-dimensional data (Q2343249) (← links)
- ASKIT: an efficient, parallel library for high-dimensional kernel summations (Q2830640) (← links)
- Approximate nearest neighbors and sequence comparison with block operations (Q3192009) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- (Q4638108) (← links)
- (Q4778562) (← links)
- Nearest neighbor sampling of point sets using rays (Q6575299) (← links)
