Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
From MaRDI portal
Publication:3603512
DOI10.1007/978-3-540-73951-7_4zbMath1209.68164OpenAlexW1898304433MaRDI QIDQ3603512
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10445/3004
Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Lower bounds on lattice sieving and information set decoding, Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny), Lattice Sieving via Quantum Random Walks, Lattice-based locality sensitive hashing is optimal, Index structures for fast similarity search for real-valued vectors. I, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Local Density Estimation in High Dimensions