1120 search results - page 53 / 224 » Eager Markov Chains |
111
click to vote
ICML
2009
IEEE
15 years 6 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...
113
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
112
click to vote
MM
2000
ACM
15 years 4 months ago
2000
ACM
In highly interactive multimedia applications startup latency is significant, and may negatively impact performance and Quality of Service (QoS). To avoid this, our approach is t...
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
BMVC
2000
15 years 1 months ago
2000
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...