235 search results - page 40 / 47 » Compiling Bayesian Networks Using Variable Elimination |
IJUFKS
2000
13 years 7 months ago
2000
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
IJRR
2006
13 years 7 months ago
2006
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
As an extension of Bayesian network, module network is an appropriate model for inferring causal network of a mass of variables from insufficient evidences. However learning such ...
VECPAR
2004
Springer
14 years 24 days ago
2004
Springer
In this work we investigate how the compiler technique of message strip mining performs in practice on contemporary high performance networks. Message strip mining attempts to redu...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. A new method is proposed for compiling causal independencies into Markov logic networks (MLNs). An MLN can be viewed as compactly representing a factorization of a joint ...