Pages that link to "Item:Q3581520"

The following pages link to Entropy based nearest neighbor search in high dimensions (Q3581520):

Displaying 8 items.

• Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
• GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions (Q2023176) (← links)
• Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
• An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
• Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898) (← links)
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
• Local Density Estimation in High Dimensions (Q5870349) (← links)