Sciweavers

272 search results - page 13 / 55
» Lazy tree splitting
Sort
View
TALG
2008
127views more  TALG 2008»
13 years 7 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
WABI
2004
Springer
107views Bioinformatics» more  WABI 2004»
14 years 28 days ago
Phylogenetic Super-networks from Partial Trees
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
ACL
1996
13 years 9 months ago
Incremental Parser Generation for Tree Adjoining Grammars
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modi cations to the inp...
Anoop Sarkar
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
14 years 8 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
13 years 11 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski