Sciweavers

Share
STOC   1998 Annual ACM Symposium on Theory of Computing
Wall of Fame | Most Viewed STOC-1998 Paper
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
9 years 4 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source190
2Download preprint from source167
3Download preprint from source141
4Download preprint from source139
5Download preprint from source139
6Download preprint from source135
7Download preprint from source129
8Download preprint from source125
9Download preprint from source121
10Download preprint from source115
11Download preprint from source115
12Download preprint from source115
13Download preprint from source112
14Download preprint from source112
15Download preprint from source112
16Download preprint from source111
17Download preprint from source109
18Download preprint from source108
19Download preprint from source105
20Download preprint from source105
21Download preprint from source99
22Download preprint from source96
23Download preprint from source92
24Download preprint from source89
25Download preprint from source89
26Download preprint from source81
27Download preprint from source80
28Download preprint from source79
29Download preprint from source77
books