10 search results - page 2 / 2 » Music Matching Based on Rough Longest Common Subsequence |
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
DEXAW
2002
IEEE
14 years 17 days ago
2002
IEEE
We investigate techniques for similarity analysis of spatio-temporal trajectories for mobile objects. Such kind of data may contain a great amount of outliers, which degrades the ...
MMM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we propose a new algorithm to find video clips with different temporal durations and some spatial variations. We adopt a longest common subsequence (LCS) matching t...
TCBB
2010
13 years 6 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We present a robust method to map detected facial Action Units (AUs) to six basic emotions. Automatic AU recognition is prone to errors due to illumination, tracking failures and ...