2412 search results - page 250 / 483 » Which Problems Have Strongly Exponential Complexity |
135
Voted
ACL
2003
15 years 5 months ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
141
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
154
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Probability based statistical learning methods such as mutual information and Bayesian networks have emerged as a major category of tools for reverse engineering mecha...
130
Voted
SCIA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We address the problem of incorporating transformation invariance in kernels for pattern analysis with kernel methods. We introduce a new class of kernels by so called Ha...
133
Voted
ECRTS
2002
IEEE
15 years 8 months ago
2002
IEEE
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...