Selecting Closest Vectors Through Randomization

DSpace/Manakin Repository

Selecting Closest Vectors Through Randomization

Citable link to this page

 

 
Title: Selecting Closest Vectors Through Randomization
Author: Bosley, Carl; Rabin, Michael O.

Note: Order does not necessarily reflect citation order of authors.

Citation: Bosley, Carl and Michael O. Rabin. 2000. Selecting Closest Vectors Through Randomization. Harvard Computer Science Group Technical Report TR-01-00.
Full Text & Related Files:
Abstract: 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.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:23017120
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters