1923 search results - page 385 / 385 » Weighted Decision Trees |
SIAMCOMP
2008
13 years 5 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
BMCBI
2006
13 years 5 months ago
2006
Background: The number of sequenced eukaryotic genomes is rapidly increasing. This means that over time it will be hard to keep supplying customised gene finders for each genome. ...
CORR
1998
Springer
13 years 5 months ago
1998
Springer
In this paper we present the results of comparing a statistical tagger for German based on decision trees and a rule-based Brill-Tagger for German. We used the same training corpu...