scientific article; zbMATH DE number 1445325
From MaRDI portal
Publication:4952640
zbMath0953.65042MaRDI QIDQ4952640
Publication date: 2 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dimensionality reductionpolynomial spaceLas Vegas algorithmHamming spacesproximity problemshigh-dimensional spacesnearest neighbor problemLas Vegas data structure
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Explicit Euclidean embeddings in permutation invariant normed spaces ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Tighter lower bounds for nearest neighbor search and related problems in the cell probe model ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic