75 search results - page 2 / 15 » A Graph Matching Algorithm using Data-Driven Markov Chain Mo... |
JMLR
2010
12 years 11 months ago
2010
Alternating Gibbs sampling is the most common scheme used for sampling from Restricted Boltzmann Machines (RBM), a crucial component in deep architectures such as Deep Belief Netw...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
UAI
2001
13 years 6 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
DATE
2010
IEEE
13 years 10 months ago
2010
IEEE
—We present a new technique for statistical static timing analysis (SSTA) based on Markov chain Monte Carlo (MCMC), that allows fast and accurate estimation of the right-hand tai...
CAV
2009
Springer
14 years 5 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...