Sciweavers

3319 search results - page 643 / 664
» The topology of dark networks
Sort
View
TWC
2010
13 years 5 months ago
Efficient Measurement Generation and Pervasive Sparsity for Compressive Data Gathering
We proposed compressive data gathering (CDG) that leverages compressive sampling (CS) principle to efficiently reduce communication cost and prolong network lifetime for large scal...
Chong Luo, Feng Wu, Jun Sun, Chang Wen Chen
INFOCOM
2011
IEEE
13 years 2 months ago
Experimental evaluation of optimal CSMA
Abstract—By ‘optimal CSMA’ we denote a promising approach to maximize throughput-based utility in wireless networks without message passing or synchronization among nodes. De...
Bruno Nardelli, Jinsung Lee, Kangwook Lee, Yung Yi...
INTEGRATION
2008
183views more  INTEGRATION 2008»
13 years 11 months ago
Network-on-Chip design and synthesis outlook
With the growing complexity in consumer embedded products, new tendencies forecast heterogeneous Multi-Processor SystemsOn-Chip (MPSoCs) consisting of complex integrated component...
David Atienza, Federico Angiolini, Srinivasan Mura...
WWW
2009
ACM
14 years 11 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts
SPAA
2009
ACM
14 years 5 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski