511 search results - page 7 / 103 » Lower bounds for distributed markov chain problems |
SIAMCOMP
2000
13 years 7 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
JCM
2006
13 years 7 months ago
2006
In this paper, we introduce a novel medium access control (MAC) protocol for Radio Frequency Identification (RFID) systems. This protocol exploits the Markov Chain Model of Slotted...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...
UAI
2001
13 years 9 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
TWC
2011
13 years 2 months ago
2011
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...