Sciweavers

48 search results - page 1 / 10
» Path Coupling Using Stopping Times
Sort
View
FCT
2005
Springer
13 years 9 months ago
Path Coupling Using Stopping Times
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
13 years 5 months ago
Variable length path coupling
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
Thomas P. Hayes, Eric Vigoda
CISS
2008
IEEE
13 years 10 months ago
Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view
— As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due...
Junshan Zhang
DSN
2011
IEEE
12 years 3 months ago
Cross-layer resilience using wearout aware design flow
—As process technology shrinks devices, circuits experience accelerated wearout. Monitoring wearout will be critical for improving the efficiency of error detection and correctio...
Bardia Zandian, Murali Annavaram
TPDS
1998
108views more  TPDS 1998»
13 years 3 months ago
Critical Path Profiling of Message Passing and Shared-Memory Programs
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...
Jeffrey K. Hollingsworth