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

Facility

St.Petersburg California Institute of Technology Define / Steklov Institute of Mathematics / /

IndustryTerm

nearest-neighbor search / social networks / search domain / social network / scalar product / search time / /

Organization

Steklov Institute of Mathematics / MIT / St.Petersburg California Institute of Technology Define / /

Person

B. Hoffmann / R. Lee Navigating / Yury Lifshits / /

Position

Zipf model / General / /

PublishedMedium

Theoretical Computer Science / /

Technology

35 Arwalk Algorithm / Proof Ring-Separator Lemma Greedy algorithm / Reduction Algorithm / similarity visualization Construct algorithms / 35 Ranwalk Algorithm / Arwalk algorithm / pdf / 35 Then Ranwalk algorithm / /

URL

http /

SocialTag