Back to Results
First PageMeta Content
Information retrieval / Nearest neighbor search / K-nearest neighbor algorithm / Factorial / Minkowski–Bouligand dimension / Locality-sensitive hashing / Exponential mechanism / Mathematics / Information science / Search algorithms


Making Nearest Neighbors Easier Restrictions on Input Tractable solution: poly (n) preprocessing, poly log(n) search time General case of nearest neighbors seems to be intractable
Add to Reading List

Document Date: 2007-09-11 19:50:50


Open Document

File Size: 215,32 KB

Share Result on Facebook
UPDATE