Sciweavers

5699 search results - page 80 / 1140
» Alternating model trees
Sort
View
BMCBI
2010
135views more  BMCBI 2010»
15 years 4 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
ACTA
2008
88views more  ACTA 2008»
15 years 2 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
DEXA
2009
Springer
127views Database» more  DEXA 2009»
15 years 10 months ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 4 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
ACL
2009
15 years 2 months ago
Improving Tree-to-Tree Translation with Packed Forests
Current tree-to-tree models suffer from parsing errors as they usually use only 1best parses for rule extraction and decoding. We instead propose a forest-based tree-to-tree model...
Yang Liu, Yajuan Lü, Qun Liu