Graph-based time-space trade-offs for approximate near neighbors
DOI10.4230/LIPICS.SOCG.2018.57zbMATH Open1489.68365arXiv1712.03158MaRDI QIDQ5115825FDOQ5115825
Authors: Thijs Laarhoven
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1712.03158
Recommendations
- Optimal hashing-based time-space trade-offs for approximate near neighbors
- New directions in nearest neighbor searching with applications to lattice sieving
- scientific article; zbMATH DE number 1559575
- scientific article; zbMATH DE number 1953148
- Space-time tradeoffs for approximate nearest neighbor searching
similarity searchlocality-sensitive hashingapproximate nearest neighbor problemlocality-sensitive filtersnear neighbor graphs
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Pattern recognition and machine learning.
- Pattern classification.
- Extensions of Lipschitz mappings into a Hilbert space
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
- Similarity estimation techniques from rounding algorithms
- Title not available (Why is that?)
- On nearest-neighbor graphs
- Title not available (Why is that?)
- Locality-sensitive hashing scheme based on p-stable distributions
- Separators for sphere-packings and nearest neighbor graphs
- Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
- New directions in nearest neighbor searching with applications to lattice sieving
- LSH Forest: Practical Algorithms Made Theoretical
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Distributed computation of the \textit{k}nn graph for large high-dimensional point sets
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Title not available (Why is that?)
- Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
- Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
- A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient algorithms for substring near neighbor problem
Cited In (2)
Uses Software
This page was built for publication: Graph-based time-space trade-offs for approximate near neighbors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115825)
