122 search results - page 18 / 25 » A Short Cut to Optimal Sequences |
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Human action video sequences can be considered as nonlinear dynamic shape manifolds in the space of image frames. In this paper, we address learning and classifying human actions ...
125
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we present a novel approach to keyframe-based tracking, called bi-directional tracking. Given two object templates in the beginning and ending keyframes, the bi-dire...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...