Sciweavers

866 search results - page 113 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
SPAA
2010
ACM
15 years 11 months ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
SIGCOMM
2010
ACM
15 years 6 months ago
Efficient error estimating coding: feasibility and applications
Motivated by recent emerging systems that can leverage partially correct packets in wireless networks, this paper investigates the novel concept of error estimating codes (EEC). W...
Binbin Chen, Ziling Zhou, Yuda Zhao, Haifeng Yu
AHSWN
2010
130views more  AHSWN 2010»
15 years 6 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
SPAA
2006
ACM
16 years 8 days ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
SBCCI
2005
ACM
114views VLSI» more  SBCCI 2005»
15 years 12 months ago
Traffic generation and performance evaluation for mesh-based NoCs
The designer of a system on a chip (SoC) that connects IP cores through a network on chip (NoC) needs methods to support application performance evaluation. Two key aspects these ...
Leonel Tedesco, Aline Mello, Diego Garibotti, Ney ...