2233 search results - page 144 / 447 » On the Complexity of Theory Curbing |
194
click to vote
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Perfection has been used as a criteria to select rearrangement scenarios since 2004. However, there is a fundamental bias towards extant species in the original definitio...
144
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
175
click to vote
TCOM
2010
15 years 4 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
165
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
140
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...