| Document Date: 2006-04-04 10:49:25
Open Document File Size: 184,39 KBShare Result on Facebook
Company SIAM Journal / IEEE Press / / Facility College Park / University of Maryland / / IndustryTerm search strategies / minimum distortion encoding algorithm / randomized search / search fails / speech compression applications / query processing / greedy search / mic search time / nearest neighbor search problem / search path / good solutions / proposed search strategy / binary search / polylogarithmic search time / naive linear time algorithm / search procedure / k-d tree algorithm / speech processing applications / speech processing / search strategy / search algorithm / expected-time algorithms / modified est neighbor search problem / simpler greedy search / search algorithms / / NaturalFeature Arya mountain / D. M. mountain / S. mountain / S. Arya mountain / / Organization National Science Foundation / Department of Computer Science / Institute for Advanced Computer Studies / University of Maryland / College Park / / Person David Mount / Proc / / Position representative / head / / ProvinceOrState Maryland / / PublishedMedium SIAM Journal on Computing / IEEE Transactions on Communications / IEEE Transactions on Information Theory / / Technology Our algorithm / minimum distortion encoding algorithm / randomized algorithm / search algorithm / expected-time algorithms / naive linear time algorithm / search algorithms / time algorithm / The algorithm / k-d tree algorithm / bucketing algorithm / The k-d tree algorithm / The search algorithm / /
SocialTag |
Approximate Nearest Neighbor Queries in Fixed Dimensions∗ Sunil Arya† David M. Mount‡ S and computing the distance to q. More efficient approaches are based on preprocessing the points S and creating a data structu