 A simple algorithm for nearest neighbor search in high dimensions", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.  Pattern Recognition - Pagina 66door Sergios Theodoridis, Konstantinos Koutroumbas - 2006 - 856 pagina’sGedeeltelijke weergave - Over dit boek
 | Francisco José Perales - 2003 - 1194 pagina’s
...preprocessing-time and memory requirements. Pattern Recognition Letters (1994) 15 9-17 [14] Nene, S., Nayar, S.: A Simple Algorithm for Nearest Neighbor Search in...IEEE Transactions on Pattern Analysis and Machine Intelligence (1997) 19(9) 989-1003 [15] Ramasubramanian, R., Paliwal, KK: Fast nearest-neighbor search... | |
 | Joost N. Kok, Jacek Koronacki, Ramon Lopez de Mantaras, Stan Matwin, Dunja Mladenic - 2007 - 660 pagina’s
...Proc. 13th Annual ACM symposium on Theory of Computing, pp. 604-613. ACM Press, New York (1998) 6. Nene, SA, Nayar, SK: A simple algorithm for nearest neighbor search in high dimensions. IEEE Trans. Pattern Anal. Mach. Intell. 19(9), 989-1003 (1997) 7. Datar, M., Immorlica, N., Indyk, P., Mirrokni,... | |
| |
