Sciweavers

302 search results - page 2 / 61
» Asymptotic performance of distributed detection over random ...
Sort
View
SPAA
1993
ACM
13 years 9 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
ICASSP
2008
IEEE
13 years 12 months ago
Energy efficient change detection over a MAC using physical layer fusion
We propose a simple and energy efficient distributed Change Detection scheme for sensor networks based on Page’s parametric CUSUM algorithm. The sensor observations are IID ove...
Taposh Banerjee, Veeraruna Kavitha, Vinod Sharma
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 5 months ago
Linear Operator Channels over Finite Fields
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
Shenghao Yang, Siu-Wai Ho, Jin Meng, En-Hui Yang
ICC
2011
IEEE
219views Communications» more  ICC 2011»
12 years 5 months ago
Deterministic Equivalents for the Performance Analysis of Isometric Random Precoded Systems
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
Jakob Hoydis, Romain Couillet, Mérouane Deb...
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
13 years 11 months ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge