Sciweavers

1640 search results - page 114 / 328
» Conditional Independence Trees
Sort
View
127
Voted
TSMC
2008
100views more  TSMC 2008»
15 years 3 months ago
Instruction-Matrix-Based Genetic Programming
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
BMCBI
2006
183views more  BMCBI 2006»
15 years 3 months ago
Mining gene expression data by interpreting principal components
Background: There are many methods for analyzing microarray data that group together genes having similar patterns of expression over all conditions tested. However, in many insta...
Joseph C. Roden, Brandon W. King, Diane Trout, Ali...
DAM
2010
81views more  DAM 2010»
15 years 3 months ago
Parallel cleaning of a network with brushes
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
Serge Gaspers, Margaret-Ellen Messinger, Richard J...
ML
2008
ACM
100views Machine Learning» more  ML 2008»
15 years 3 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
ICALP
2009
Springer
16 years 3 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...