129 search results - page 4 / 26 » Time Warp Edit Distance |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
DKE
2007
13 years 7 months ago
2007
Continuously monitoring through time the correlation/distance of multiple data streams is of interest in a variety of applications, including financial analysis, video surveillanc...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
IJCNN
2008
IEEE
14 years 1 months ago
2008
IEEE
— Effective use of support vector machines (SVMs) in classification necessitates the appropriate choice of a kernel. Designing problem specific kernels involves the definition...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Shape warping is a key problem in statistical shape analysis. This paper proposes a framework for geometric shape warping based on both shape distances and landmarks. Our method i...