2626 search results - page 187 / 526 » The complexity of stochastic sequences |
160
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
179
click to vote
PRICAI
2004
Springer
15 years 12 months ago
2004
Springer
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
149
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
Resolution enhancement for video sequences has always been an attractive application in multimedia signal processing. "Superresolution" methods, that combine non-redunda...
199
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper addresses the challenge of recognizing dynamic
textures based on their observed visual dynamics.
Typically, the term dynamic texture is used with reference
to image s...
219
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper, we present a method that recognizes single or multiple common actions between a pair of video sequences. We establish an energy function that evaluates geometric and...