scientific article; zbMATH DE number 7204341
From MaRDI portal
Publication:5111221
DOI10.4230/LIPIcs.MFCS.2017.7zbMath1441.68266arXiv1702.05760MaRDI QIDQ5111221
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1702.05760
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
large deviationsdimensionality reductionlocality-sensitive hashinglattice algorithmsapproximate near neighbors
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How many entries of a typical orthogonal matrix can be approximated by independent normals?
- Large deviations techniques and applications.
- Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
- Optimal Data-Dependent Hashing for Approximate Near Neighbors
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
- 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
- Sieve algorithms for the shortest vector problem are practical
- Lower Bounds on Locality Sensitive Hashing
- Similarity estimation techniques from rounding algorithms
- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
- New directions in nearest neighbor searching with applications to lattice sieving
- A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
- Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
- Beyond Locality-Sensitive Hashing
