5785 search results - page 245 / 1157 » Approximability of Probability Distributions |
126
click to vote
TIT
2011
14 years 11 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
138
click to vote
CORR
2012
Springer
14 years 4 days ago
2012
Springer
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
123
click to vote
IJAR
2007
15 years 4 months ago
2007
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
131
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
132
click to vote
RSA
2002
15 years 4 months ago
2002
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...