scientific article; zbMATH DE number 1445324

MaRDI QIDQ4952639zbMATH OpenFDO

Authors Peter N. Yianilos

Publication date 10 May 2000

zbMATH Keywords

aggressive pruningalgorithmsEuclidean hypercubemaximum interpoint distancenearest neighbor searchsearch complexity

Mathematics Subject Classification ID

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

Cited in

(5)

• Parallel query processing on distributed clustering indexes
• Lower bounds for high dimensional nearest neighbor search and related problems
• scientific article; zbMATH DE number 2065612 (Why is no real title available?)
• Index structures for fast similarity search for real vectors. II
• Probabilistic proximity searching algorithms based on compact partitions

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