806 search results - page 80 / 162 » Lower Bounds on Correction Networks |
154
click to vote
NN
1997
Springer
15 years 10 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
158
click to vote
SIROCCO
2004
15 years 7 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
152
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper addresses the issue of network life during repeated broadcasts originating from the same source in large, strip-shaped wireless sensor networks. The proposed technique w...
154
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
174
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...