Sciweavers

530 search results - page 17 / 106
» Bounds on marginal probability distributions
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 6 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 2 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
COLT
2005
Springer
13 years 9 months ago
Data Dependent Concentration Bounds for Sequential Prediction Algorithms
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
Tong Zhang
CDC
2008
IEEE
136views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed hypothesis testing with a fusion center: The conditionally dependent case
Abstract— The paper deals with decentralized Bayesian detection with M hypotheses, and N sensors making conditionally correlated measurements regarding these hypotheses. Each sen...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 6 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale