Sciweavers

720 search results - page 30 / 144
» Linear k-arboricities on trees
Sort
View
AI
2009
Springer
14 years 1 months ago
Enumerating Unlabeled and Root Labeled Trees for Causal Model Acquisition
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs to be assessed for each node. It generally has the comple...
Yang Xiang, Zoe Jingyu Zhu, Yu Li
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
14 years 26 days ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
EACL
1993
ACL Anthology
13 years 10 months ago
The Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
K. Vijay-Shanker
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
14 years 2 months ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
14 years 1 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...