Sciweavers

1594 search results - page 42 / 319
» Fast Prediction on a Tree
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 9 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
SIGKDD
2002
78views more  SIGKDD 2002»
13 years 7 months ago
Predicting the Effects of Gene Deletion
In this paper, we describe techniques that can be used to predict the effects of gene deletion. We will focus mainly on the creation of predictive variables, and then briefly disc...
David S. Vogel, Randy C. Axelrod
EOR
2006
130views more  EOR 2006»
13 years 8 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
ACL
1996
13 years 9 months ago
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
Richard Sproat, Michael Riley
IDA
2009
Springer
13 years 5 months ago
Isotonic Classification Trees
Abstract. We propose a new algorithm for learning isotonic classification trees. It relabels non-monotone leaf nodes by performing the isotonic regression on the collection of leaf...
Rémon van de Kamp, Ad Feelders, Nicola Bari...