1063 search results - page 157 / 213 » Capacity of steganographic channels |
ICCAD
2005
IEEE
15 years 8 months ago
2005
IEEE
Process variations in nanometer technologies are becoming an important issue for cutting-edge FPGAs with a multimillion gate capacity. Considering both die-to-die and withindie va...
IJCNN
2008
IEEE
2008
IEEE
Large developing axonal arbors using a distributed and locally-reprogrammable address-event receiver
15 years 6 months ago
Abstract— We have designed a distributed and locally reprogrammable address event receiver. Incoming address-events are monitored simultaneously by all synapses, allowing for arb...
ICASSP
2009
IEEE
15 years 3 months ago
2009
IEEE
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
WOTUG
2008
15 years 1 months ago
2008
Abstract. We prove the correctness of a two-way sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data trans...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
Abstract— We study the degrees of freedom characterization of wireless X networks, i.e. networks of M distributed single antenna transmitters and N distributed single antenna rec...