Pages that link to "Item:Q2941575"

The following pages link to Optimal Data-Dependent Hashing for Approximate Near Neighbors (Q2941575):

Displaying 23 items.

• Index structures for fast similarity search for binary vectors (Q681740) (← links)
• Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
• Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
• Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
• Multidimensional quantile hashing is very efficient for nonuniform distributions (Q1824378) (← links)
• ForestDSH: a universal hash design for discrete probability distributions (Q2036729) (← links)
• Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
• Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
• An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
• Locality-Sensitive Hashing Without False Negatives for $$l_p$$ (Q2817854) (← links)
• Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
• Efficient Nearest Neighbors via Robust Sparse Hashing (Q4592402) (← links)
• Hash Bit Selection for Nearest Neighbor Search (Q4619111) (← links)
• (Q4638108) (← links)
• Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
• (Q5005170) (← links)
• (Q5111221) (← links)
• (Q5121902) (← links)
• Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. (Q5136284) (← links)
• Local Density Estimation in High Dimensions (Q5870349) (← links)
• A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
• Lattice Sieving via Quantum Random Walks (Q6045073) (← links)