147 search results - page 11 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
130
Voted
IJCNN
2008
IEEE
15 years 4 months ago
2008
IEEE
—In motor imagery-based Brain Computer Interfaces (BCI), discriminative patterns can be extracted from the electroencephalogram (EEG) using the Common Spatial Pattern (CSP) algor...
DISCO
1993
15 years 1 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
121
click to vote
AIHC
2007
Springer
15 years 3 months ago
2007
Springer
This work addresses the problem of human action recognition by introducing a representation of a human action as a collection of short trajectories that are extracted in areas of ...
BMCBI
2006
14 years 9 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
TCBB
2010
14 years 8 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...