scientific article; zbMATH DE number 1445325

MaRDI QIDQ4952640zbMATH OpenFDO

Authors Piotr Indyk

Publication date 2 February 2001

zbMATH Keywords

dimensionality reductionHamming spaceshigh-dimensional spacesLas Vegas algorithmLas Vegas data structurenearest neighbor problempolynomial spaceproximity problems

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• Reductions among high dimensional proximity problems
• scientific article; zbMATH DE number 1775450
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Approximate nearest neighbor: towards removing the curse of dimensionality
• scientific article; zbMATH DE number 1559575

Cited in

(11)

• On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
• Reductions among high dimensional proximity problems
• Proximity algorithms for nearly-doubling spaces
• scientific article; zbMATH DE number 2079383 (Why is no real title available?)
• Explicit Euclidean embeddings in permutation invariant normed spaces
• On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity
• On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
• Optimal Las Vegas approximate near neighbors in \(\ell_p\)
• Proximity algorithms for nearly doubling spaces
• On the distance concentration awareness of certain data reduction techniques
• Tighter lower bounds for nearest neighbor search and related problems in the cell probe model

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 Q4952640)