Sciweavers

3240 search results - page 68 / 648
» Pre-aggregation with probability distributions
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 7 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
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 distribut...
Ido Tal, Ron M. Roth
TIT
2011
116views more  TIT 2011»
13 years 4 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—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...
Ido Tal, Ron M. Roth
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 4 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
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...
Robert Fink, Larisa Han, Dan Olteanu
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 9 months ago
Algorithmic Theories of Everything
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...
Jürgen Schmidhuber
RSA
2002
69views more  RSA 2002»
13 years 8 months ago
On the covariance of the level sizes in random recursive trees
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, ...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...