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 req

First Page		Document Content
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 req Add to Reading List Source URL: hunch.net Download Document from Source Website File Size: 154,49 KB Share Document on Facebook