![Mathematics / Hash function / Locality-sensitive hashing / Hash table / Nearest neighbor search / Hamming weight / Trie / K-d tree / Hamming distance / Search algorithms / Information science / Information retrieval Mathematics / Hash function / Locality-sensitive hashing / Hash table / Nearest neighbor search / Hamming weight / Trie / K-d tree / Hamming distance / Search algorithms / Information science / Information retrieval](https://www.pdfsearch.io/img/a2d6593fa7d1d024c136678ef5022f4d.jpg)
| Document Date: 2012-06-28 15:40:37 Open Document File Size: 407,41 KBShare Result on Facebook
City Munich / P. Perona / / Company 1M / MIT Press / Euclidean NN / / / Event Product Issues / Product Recall / / Facility We store / To store / Computer Science University of Toronto / / IndustryTerm vision applications / multi-indexing algorithm / desired search radius / search performance / near neighbor search / required search radius / multi-index hashing algorithm / query-dependent search radii / sub-linear search times / large scale image search / search accuracy / neighbor search / search cost / expected search radius / multi-index search / search problem / search time increases / given search radius / image search / large search radii / search speed / Near-optimal hashing algorithms / proposed multi-index hashing algorithm / exhaustive search / search radii / learning algorithm / nearest neighbor search / search problems / search radius / / MarketIndex case 1000 / / Organization MIT / University of Toronto / Multi-Index Hashing Mohammad Norouzi Ali Punjani David J. Fleet Department / / Person David J. Fleet / Mohammad Norouzi Ali Punjani David / / Position D. J. / / Product rates / Euc / / ProgrammingLanguage C++ / / Technology multi-indexing algorithm / learning algorithm / A. Implementation Details Our algorithm / proposed multi-index hashing algorithm / caching / multi-index hashing algorithm / /
SocialTag |