Sciweavers

1722 search results - page 71 / 345
» Variables in Concept Graphs
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 7 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
JMLR
2008
120views more  JMLR 2008»
14 years 9 months ago
Causal Reasoning with Ancestral Graphs
Causal reasoning is primarily concerned with what would happen to a system under external interventions. In particular, we are often interested in predicting the probability distr...
Jiji Zhang
JMLR
2006
118views more  JMLR 2006»
14 years 9 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
SPRINGSIM
2010
14 years 8 months ago
Using factored bond graphs for distributed diagnosis of physical systems
This paper presents a distributed Bayesian fault diagnosis scheme for physical systems. Our diagnoser design is based on a procedure for factoring the global system bond graph (BG...
Indranil Roychoudhury, Gautam Biswas, Xenofon D. K...
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 4 months ago
Partition Functions of Normal Factor Graphs
—One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After “normalization,” a sum ...
G. David Forney Jr., Pascal O. Vontobel