Detail of Publication
| Text Language | Japanese |
|---|---|
| Authors | Tomoyuki Muto,Masashi Tada,Masakazu Iwamura,Koichi Kise |
| Title | Efficient Approximate Nearest Neighbor Search Based on Accessing Neighboring Buckets |
| Journal | IEICE Tecnical Report |
| Presentation number | PRMU2009-53 |
| Pages | pp.83-88 |
| Month & Year | June 2009 |
| Abstract | Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory for nearest neighbor search. Further reduction of required amount of memory of the approximate nearest neighbor search is an important task. In this paper, we model a method to access neighboring buckets, and reveal the method requires less amount of memory than LSH by an experiment and analysis. |
- Following file is available.
- Entry for BibTeX
@InCollection{Muto2009, author = {Tomoyuki Muto and Masashi Tada and Masakazu Iwamura and Koichi Kise}, title = {Efficient Approximate Nearest Neighbor Search Based on Accessing Neighboring Buckets}, booktitle = {IEICE Tecnical Report}, year = 2009, month = jun, presenID = {PRMU2009-53}, pages = {83--88} }