scientific article; zbMATH DE number 7236461
From MaRDI portal
Publication:5115825
DOI10.4230/LIPIcs.SoCG.2018.57zbMath1489.68365arXiv1712.03158MaRDI QIDQ5115825
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1712.03158
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed computation of the \textit{k}nn graph for large high-dimensional point sets
- On nearest-neighbor graphs
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
- Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Extensions of Lipschitz mappings into a Hilbert space
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Similarity estimation techniques from rounding algorithms
- Efficient algorithms for substring near neighbor problem
- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
- Separators for sphere-packings and nearest neighbor graphs
- New directions in nearest neighbor searching with applications to lattice sieving
- A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
- LSH Forest: Practical Algorithms Made Theoretical
- Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
- Locality-sensitive hashing scheme based on p-stable distributions
This page was built for publication:
