1031 search results - page 150 / 207 » The single-serving channel capacity |
143
click to vote
ICCAD
2005
IEEE
16 years 3 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...
157
click to vote
IJCNN
2008
IEEE
2008
IEEE
Large developing axonal arbors using a distributed and locally-reprogrammable address-event receiver
16 years 22 days 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...
157
click to vote
IWDW
2005
Springer
15 years 11 months ago
2005
Springer
The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework the...
152
click to vote
ICASSP
2009
IEEE
15 years 10 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...
146
click to vote
WOTUG
2008
15 years 7 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...