Sciweavers

2487 search results - page 84 / 498
» Partitions of Graphs into Trees
Sort
View
UAI
1997
13 years 11 months ago
Nonuniform Dynamic Discretization in Hybrid Networks
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
Alexander V. Kozlov, Daphne Koller
BPM
2008
Springer
155views Business» more  BPM 2008»
13 years 11 months ago
The Refined Process Structure Tree
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
Jussi Vanhatalo, Hagen Völzer, Jana Koehler
GPEM
2000
103views more  GPEM 2000»
13 years 9 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
AAAI
1994
13 years 11 months ago
Emergent Linguistic Rules from inducing Decision Trees: Disambiguating Discourse Clue Words
We apply decision tree induction to the problem of discourse clue word sense disambiguation. The automatic partitioning of the training set which is intrinsic to decision tree ind...
Eric V. Siegel, Kathleen McKeown
LATA
2009
Springer
14 years 4 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez