Selecting Closest Vectors Through Randomization

Carl Bosley, Michael O. Rabin · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · 2000

We consider the problem of finding the closest vectors to a given vector in a large set of vectors, and propose a randomized solution. The method has applications in Automatic Target Recognition (ATR), Web Information Retrieval, and Data Mining.

Read the paper · More papers on PaperTik