Sciweavers

Share
RSFDGRC
2005
Springer

On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks

10 years 6 months ago
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks, which conventionally are believed to have efficient inference algorithms, the computational complexity is still NP-hard.
Dan Wu, Cory J. Butz
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where RSFDGRC
Authors Dan Wu, Cory J. Butz
Comments (0)
books