Results 1  10
of
567,318
Markov Chain Algorithms for Planar Lattice Structures
, 1995
"... Consider the following Markov chain, whose states are all domino tilings of a 2n x 2n chessboard: starting from some arbitrary tiling, pick a 2 x 2 window uniformly at random. If the four squares appearing in this window are covered by two parallel dominoes, rotate the dominoes 90° in place. Repeat ..."
Abstract

Cited by 110 (11 self)
 Add to MetaCart
Consider the following Markov chain, whose states are all domino tilings of a 2n x 2n chessboard: starting from some arbitrary tiling, pick a 2 x 2 window uniformly at random. If the four squares appearing in this window are covered by two parallel dominoes, rotate the dominoes 90° in place. Repeat
Fast Markov chain algorithms for calculating DempsterShafer belief
 In Proceedings of the 12th European Conference on Artificial Intelligence
, 1996
"... Abstract. We present a new type of Markov Chain algorithm for the calculation of combined DempsterShafer belief which is almost linear in the size of the frame, thus making the calculation of belief feasible for a wider range of problems. We also indicate how these algorithms may be used in the cal ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We present a new type of Markov Chain algorithm for the calculation of combined DempsterShafer belief which is almost linear in the size of the frame, thus making the calculation of belief feasible for a wider range of problems. We also indicate how these algorithms may be used
A Markov Chain Algorithm for determining Crossing Times through nested Graphs
"... According to the by now established theory developed in order to define a Laplacian or – equivalently – a Brownian motion on a nested fractal, one has to solve certain renormalization problems. In this paper, we present a Markov chain algorithm solving the problem for certain classes of simple fract ..."
Abstract
 Add to MetaCart
According to the by now established theory developed in order to define a Laplacian or – equivalently – a Brownian motion on a nested fractal, one has to solve certain renormalization problems. In this paper, we present a Markov chain algorithm solving the problem for certain classes of simple
Simple Markovchain algorithms for generating bipartite graphs and tournaments (Extended Abstract)
, 1997
"... ) Ravi Kannan Prasad Tetali y Santosh Vempala z Abstract We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems. For the firs ..."
Abstract

Cited by 61 (0 self)
 Add to MetaCart
) Ravi Kannan Prasad Tetali y Santosh Vempala z Abstract We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms
 in Statistical Physics, Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer
, 1999
"... We study two widely used algorithms, Glauber dynamics and the SwendsenWang algorithm, on rectangular subsets of the hypercubic lattice Z d. We prove that under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in L d−1. In other wo ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
We study two widely used algorithms, Glauber dynamics and the SwendsenWang algorithm, on rectangular subsets of the hypercubic lattice Z d. We prove that under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in L d−1. In other
Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
"... In this paper we analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis then is refined to obtain a canonical path analysis too. The construction of the flow and the canonical paths is based on related path ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis then is refined to obtain a canonical path analysis too. The construction of the flow and the canonical paths is based on related
Efficient Schemes for Monte Carlo Markov Chain Algorithms in Global Illumination
"... Abstract. Current MCMC algorithms are limited from achieving high rendering efficiency due to possibly high failure rates in caustics perturbations and stratified exploration of the image plane. In this paper we improve the MCMC approach significantly by introducing new lens perturbation and new pat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Current MCMC algorithms are limited from achieving high rendering efficiency due to possibly high failure rates in caustics perturbations and stratified exploration of the image plane. In this paper we improve the MCMC approach significantly by introducing new lens perturbation and new
Markov Chain Algorithms: A Template for Building Future Robust Low Power Systems
"... Abstract—Although computational systems are looking towards post CMOS devices in the pursuit of lower power, the inherent unreliability of such devices makes it difficult to design robust systems without additional power overheads for guaranteeing robustness. As such, algorithmic structures with in ..."
Abstract
 Add to MetaCart
with inherent ability to tolerate computational errors are of significant interest. We propose to cast applications as stochastic algorithms based on Markov chains as such algorithms are both sufficiently general and tolerant to transition errors. We show with four example applications boolean satisfiability
An introduction to hidden Markov models
 IEEE ASSp Magazine
, 1986
"... The basic theory of Markov chains has been known to ..."
Abstract

Cited by 1110 (2 self)
 Add to MetaCart
The basic theory of Markov chains has been known to
Results 1  10
of
567,318