1120 search results - page 66 / 224 » Eager Markov Chains |
146
click to vote
VOSS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The paper presents a survey of out-of-core methods available for the analysis of large Markov chains on single workstations. First, we discuss the main sparse matrix stor...
173
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
158
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
Despite the growth of Internet and the advances in WWW technology, current methods for web users to make good use of information from so enormous web pages are not as efficient as ...
161
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
This work presents techniques for computing the switching activities of all circuit nodes under pseudorandom or biased input sequences and assuming a zero delay mode of operation....
153
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...