Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FCS
2006

favoriteEmaildiscussreport

133views Computer Science» more FCS 2006»

Speeeding Up Markov Chain Monte Carlo Algorithms

13 years 5 months ago

Speeeding Up Markov Chain Monte Carlo Algorithms

Download ww1.ucmss.com

We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller space, such that the aggregated chain approximately preserves the Markov property.

Andras Farago

Real-time Traffic

FCS 2006 | FCS 2007 | Important Special Case | Markov Chain Monte Carlo | Markov Property |

claim paper

Related Content

» Decrypting classical cipher text using Markov chain Monte Carlo

» A Markov Chain Monte Carlo Approach to Stereovision

» Markov Chain Monte Carlo

» Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Ca...

» Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optim...

» A Graph Matching Algorithm using DataDriven Markov Chain Monte Carlo Sampling

» A reversible jump Markov chain Monte Carlo algorithm for analysis of functional neuroimage...

» Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics

» Parallel Algorithms for Bayesian Indoor Positioning Systems

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2006
Where	FCS
Authors	Andras Farago

Comments (0)