The following pages link to (Q4542584):
Displaying 24 items.
- Decomposable algorithms for nearest neighbor computing (Q436812) (← links)
- Iterative denoising (Q626230) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data (Q2032151) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Vector representations for efficient comparison and search for similar strings (Q2480497) (← links)
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions (Q2507694) (← links)
- The black-box complexity of nearest-neighbor search (Q2581270) (← links)
- Parallel algorithms for nearest neighbor search problems in high dimensions (Q2830635) (← links)
- Approximate nearest neighbor search for low-dimensional queries (Q2839174) (← links)
- A Heterogeneous High-Dimensional Approximate Nearest Neighbor Algorithm (Q2989754) (← links)
- Limitations on Quantum Dimensionality Reduction (Q3012794) (← links)
- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere (Q3603512) (← links)
- (Q4533705) (← links)
- Efficient Nearest Neighbors via Robust Sparse Hashing (Q4592402) (← links)
- (Q5090388) (← links)
- (Q5111687) (← links)
- Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances (Q5236204) (← links)
- (Q5365086) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
- Towards a Theory of Intrusion Detection (Q5862669) (← links)
