CSE 254 Handout Nearest Neighbor Preserving Embeddings 1 Nearest Neighbor Search (2008)
Paper Piotr Indyk, Assaf Naor, Konstantin Pervyshev
Problem 1 (The nearest neighbor problem). Given a set X ⊂ R n, build a data structure which given any query x ∈ R n, quickly reports the point x ′ in X that is (approximately) closest to x....