Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Metropolis-Hasting"”.

  1. Evaluating The Efficiency of Markov Chain Monte Carlo Algorithms

    … to demonstrate how the Gibbs sampler and the Metropolis-Hasting algorithm works and how MCMC diagnostic tests are used to check for MCMC convergence. We investigated and compared the efficiency of different MCMC algorithms fit to a linear and a spatial model. Our results showed that the Gibbs …

    arkansas Repository record for Evaluating The Efficiency of Markov Chain Monte Carlo Algorithms (opens in a new tab)

  2. Sampling in computer vision and Bayesian nonparametric mixtures

    … We develop the Permutation-based Gibbs-Inspired Metropolis-Hasting (PGIMH) sampling algorithm and show its applicability to a variety of formulations (including curve-length penalties and topology priors). In particle filtering, PGIMH precludes the need to update particle weights or use of …

    mit Repository record for Sampling in computer vision and Bayesian nonparametric mixtures (opens in a new tab)

  3. Analysis based on incomplete data

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-12-01

    uiuc Repository record for Analysis based on incomplete data (opens in a new tab)