5056 search results - page 26 / 1012 » Network Coding Theory |
DIALM
2007
ACM
14 years 2 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
MMSEC
2006
ACM
14 years 4 months ago
2006
ACM
Two different approaches for constructing a steganographic channel in an IEEE 802.11 (WLAN) network are introduced in this paper. First test results on the reliability, undetectab...
TELSYS
2010
13 years 4 months ago
2010
In this paper, we consider a packet scheduler exploiting multiuser diversity in a wireless network with AMC (Adaptive Modulation and Coding), and propose a packet level performance...
NIPS
2004
13 years 11 months ago
2004
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
PDP
2005
IEEE
14 years 3 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...