115 search results - page 1 / 23 » The Computational Complexity of Monotonicity in Probabilisti... |
FCT
2007
Springer
13 years 11 months ago
2007
Springer
COLT
2003
Springer
13 years 10 months ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
JCSS
2006
13 years 4 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
RSFDGRC
2005
Springer
13 years 10 months ago
2005
Springer
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,...
UAI
1998
13 years 6 months ago
1998
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...