Sciweavers

534 search results - page 48 / 107
» Power from Random Strings
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 1 months ago
Robustness and modular structure in networks
Many complex systems, from power grids and the internet, to the brain and society, can be modeled using modular networks. Modules, densely interconnected groups of elements, often...
James P. Bagrow, Sune Lehmann, Yong-Yeol Ahn
CPC
2004
76views more  CPC 2004»
13 years 9 months ago
On Some Parameters in Heap Ordered Trees
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
Kate Morris, Alois Panholzer, Helmut Prodinger
INFOCOM
2011
IEEE
13 years 1 months ago
Aggregation capacity of wireless sensor networks: Extended network case
—A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a s...
Cheng Wang, Changjun Jiang, Yunhao Liu, Xiang-Yang...
CISS
2008
IEEE
14 years 4 months ago
Dynamic data compression for wireless transmission over a fading channel
—We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where bo...
Michael J. Neely
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 10 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...