Sciweavers

889 search results - page 108 / 178
» Observational Learning in Random Networks
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
ICWN
2004
13 years 10 months ago
RED for Improving TCP over Wireless Networks
TCP was designed and tuned to work well on networks where losses are mainly congestion losses. The performance of TCP decreases dramatically when a TCP connection traverses a wire...
Saad Biaz, Xia Wang
UAI
2003
13 years 10 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
TSP
2010
13 years 3 months ago
On the optimal performance in asymmetric gaussian wireless sensor networks with fading
We study the estimation of a Gaussian source by a Gaussian wireless sensor network (WSN) where L distributed sensors transmit noisy observations of the source through a fading Gau...
Hamid Behroozi, Fady Alajaji, Tamás Linder
VTC
2010
IEEE
129views Communications» more  VTC 2010»
13 years 7 months ago
A Systematic LT Coded Arrangement for Transmission over Correlated Shadow Fading Channels in 802.11 Ad-Hoc Wireless Networks
— Systematic Luby Transform (SLT) codes constitute rateless codes, which are capable of adaptively adjusting their code rate depending on the channel quality without any explicit...
Hoang Anh Ngo, Tim Stevens, Robert G. Maunder, Laj...