564 search results - page 62 / 113 » Linear Time Algorithms for Exact Distance Transform |
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
CVPR
2001
IEEE
15 years 5 days ago
2001
IEEE
We consider learning models for object recognition from examples. Our method is motivated by systems that use the Hausdorff distance as a shape comparison measure. Typically an ob...
CAL
2002
13 years 10 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
RECOMB
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...