scientific article; zbMATH DE number 5506204

MaRDI QIDQ3601534zbMATH OpenFDO

Authors Assaf Naor, Rina Panigrahy, Rajeev Motwani

Publication date 10 February 2009

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Data structures (68P05)

Cited in

(13)

• A new lattice sieving algorithm base on angular locality-sensitive hashing
• Locality sensitive hashing with extended differential privacy
• A new coding-based algorithm for finding closest pair of vectors
• Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
• Locality-Sensitive Hashing Without False Negatives for l_p
• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
• Lower Bounds on Locality Sensitive Hashing
• On the Distortion of Locality Sensitive Hashing
• Fast cross-polytope locality-sensitive hashing
• Privacy preserving query over encrypted multidimensional massive data in cloud storage
• Efficient Associative Computation with Discrete Synapses
• Approximating Minimization Diagrams and Generalized Proximity Search
• Local Density Estimation in High Dimensions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601534)