14699 search results - page 390 / 2940 » Complexity and Cognitive Computing |
150
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
136
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
159
click to vote
ECCV
1998
Springer
15 years 9 months ago
1998
Springer
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...
153
Voted
COLT
1993
Springer
15 years 9 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
149
Voted
BMCBI
2004
15 years 4 months ago
2004
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...