564 search results - page 42 / 113 » Linear Time Algorithms for Exact Distance Transform |
COCOON
2001
Springer
14 years 10 days ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
WABI
2001
Springer
14 years 7 days ago
2001
Springer
There are very few instances in which positive Darwinian selection has been convincingly demonstrated at the molecular level. In this study, we present a novel test for detecting p...
DAM
2011
13 years 2 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...