373 search results - page 15 / 75 » On Markov Chains for Independent Sets |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
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...
TIT
2011
13 years 2 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...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Without any assumption on the cover source, this paper presents a complete characterization of all perfectly secure stego-systems that employ mutually independent embedding operat...
ICA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A nonparametric Bayesian extension of Independent Components Analysis (ICA) is proposed where observed data Y is modelled as a linear superposition, G, of a potentially i...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...