356 search results - page 34 / 72 » Continuous Nearest Neighbor Search |
120
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
113
click to vote
SISAP
2009
IEEE
15 years 7 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
113
Voted
BMCBI
2008
15 years 17 days ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
112
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
95
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...