![](https://www.pdfsearch.io/img/9d35ec7d012e73baf7039a58f322c272.jpg) Date: 2011-03-14 15:29:00
| | COVER TREES FOR NEAREST NEIGHBOR ALINA BEYGELZIMER, SHAM KAKADE, AND JOHN LANGFORD A BSTRACT. We present a tree data structure for fast nearest neighbor operations in general n-point metric spaces. The data structure reqAdd to Reading ListSource URL: hunch.netDownload Document from Source Website File Size: 154,49 KBShare Document on Facebook
|