994 search results - page 85 / 199 » Custom Computing Machines for the Set Covering Problem |
122
Voted
BMCBI
2007
15 years 20 days ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
148
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
101
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
74
Voted
INTETAIN
2005
Springer
15 years 6 months ago
2005
Springer
Webcrow is a software system whose aim is to solve crosswords. Problems of like solving crosswords have been informally defined as AI-Complete and are extremely challenging for ma...
114
Voted
ISCA
1998
IEEE
15 years 4 months ago
1998
IEEE
Future parallel computers must efficiently execute not only hand-coded applications but also programs written in high-level, parallel programming languages. Today's machines ...