4212 search results - page 288 / 843 » On Compressible Pairings and Their Computation |
165
click to vote
TCS
2008
15 years 6 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
254
click to vote
IJCNN
2008
IEEE
16 years 1 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...
180
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
190
click to vote
COGSCI
2010
15 years 6 months ago
2010
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...
159
click to vote
IJON
2007
15 years 6 months ago
2007
We investigate a computational model of the emergence of gaze following that is based on a generic basic set of mechanisms. Whereas much attention has been focused so far on the s...