Sciweavers

11217 search results - page 471 / 2244
» Network Coding for Wireless Networks
Sort
View
ISNN
2007
Springer
16 years 9 days ago
Sparse Coding in Sparse Winner Networks
This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local com...
Janusz A. Starzyk, Yinyin Liu, David D. Vogel
INFOCOM
2008
IEEE
16 years 17 days ago
Design of a Channel Characteristics-Aware Routing Protocol
Abstract—Radio channel quality of real-world wireless networks tends to exhibit both short-term and long-term temporal variations that are in general difficult to model. To maxi...
Rupa Krishnan, Ashish Raniwala, Tzi-cker Chiueh
MOBIHOC
2012
ACM
13 years 8 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff
BIOSYSTEMS
2007
123views more  BIOSYSTEMS 2007»
15 years 6 months ago
Real time computation: Zooming in on population codes
Information processing in nervous systems intricately combines computation at the neuronal and network levels. Many computations may be envisioned as sequences of signal processin...
Olivier Rochel, Netta Cohen
JNSM
2006
78views more  JNSM 2006»
15 years 6 months ago
Edge-Cut Bounds on Network Coding Rates
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
Gerhard Kramer, Serap A. Savari