Beyond Locality-Sensitive Hashing Alexandr Andoni (Microsoft Research), Piotr Indyk (MIT), Huy L. Nguyen (Princeton) and Ilya Razenshteyn (MIT) (Approximate) Near Neighbor Problem ((A)NN) The main approach: data-depende - Piotr Indyk - Document - PDFSEARCH.IO

First Page	Meta Content
	Beyond Locality-Sensitive Hashing Alexandr Andoni (Microsoft Research), Piotr Indyk (MIT), Huy L. Nguyen (Princeton) and Ilya Razenshteyn (MIT) (Approximate) Near Neighbor Problem ((A)NN) The main approach: data-depende Add to Reading List Document Date: 2014-04-21 21:52:06 Open Document File Size: 254,66 KB Share Result on Facebook City Motwani / / Company Microsoft / / Country Sudan / / Currency pence / / / IndustryTerm recommendation systems / / Organization MIT / / Person Piotr Indyk / Huy L. Nguyen / Ilya Razenshteyn / / Technology DNA sequencing / / URL http / SocialTag Information retrieval Locality-sensitive hashing Hash function Hash table Piotr Indyk Search algorithms Artificial intelligence Information science

Beyond Locality-Sensitive Hashing Alexandr Andoni (Microsoft Research), Piotr Indyk (MIT), Huy L. Nguyen (Princeton) and Ilya Razenshteyn (MIT) (Approximate) Near Neighbor Problem ((A)NN) The main approach: data-dependeAdd to Reading List