1100 search results - page 111 / 220 » Approximate distance oracles |
159
click to vote
STACS
2010
Springer
16 years 23 days ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
171
click to vote
ISMIR
2005
Springer
15 years 11 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
166
Voted
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
188
Voted
ESA
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
145
click to vote
JCSS
2007
15 years 5 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...