Sciweavers

233 search results - page 3 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
JCB
2008
75views more  JCB 2008»
13 years 5 months ago
New, Improved, and Practical k-Stem Sequence Similarity Measures for Probe Design
We define new measures of sequence similarity for oligonucleotide probe design. These new measures incorporate the nearest neighbor k-stem motifs in their definition, but can be e...
Anthony J. Macula, Alexander Schliep, Morgan A. Bi...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 5 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 5 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
FOCS
2008
IEEE
13 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICAPR
2009
Springer
13 years 11 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri