| Document Date: 2006-10-01 00:51:44
Open Document File Size: 171,90 KBShare Result on Facebook
City B. Lattice / Springer-Verlag / / Company Cambridge University Press / MIT Press / / Country Sudan / / / Facility Stanford University / / IndustryTerm nearest-neighbor search / latter algorithm / Approximate algorithms / Entropy-based nearest neighbor algorithm / approximation algorithm / lattice-based algorithm / proximity search / linear algorithm / data mining / high-dimensional similarity search / Similarity search / search algorithm / / Organization Cambridge University / National Science Foundation / Department of Computer Science / MIT / Stanford University / / Person R. Silverman / A. Wu / N. Netanyahu / Alfred P. Sloan / Ofer Amrani / Alex Vardy / Erik Agrell / Lucille Packard / David Packard / / Position dy· Sd rt / second author / / Product Leech Lattice / / ProvinceOrState New York / / PublishedMedium IEEE Transactions on Communications / IEEE Transactions on Information Theory / Theory of Computing / / SportsLeague Stanford University / / Technology Entropy-based nearest neighbor algorithm / hashing-based algorithms / linear algorithm / latter algorithm / search algorithm / approximation algorithm / 1 The algorithm / time algorithm / LSH algorithms / data mining / hashing-based algorithm / machine learning / simulation / lattice-based algorithm / SDP-based approximation algorithm / Two algorithms / arbitrary dimension The algorithm / computed using Monte-Carlo simulation / / URL http /
SocialTag |
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions∗ Piotr Indyk MIT