Sciweavers

168 search results - page 15 / 34
» Lower Bounds for Distributed Coin-Flipping and Randomized Co...
Sort
View
CISS
2008
IEEE
15 years 6 months ago
A distributed scheme for detection of information flows
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
Ameya Agaskar, Lang Tong, Ting He
76
Voted
TIT
2008
92views more  TIT 2008»
14 years 11 months ago
Capacity of Ultra-Wideband Power-Constrained Ad Hoc Networks
In this correspondence, we show that the uniform throughput capacity of an ultra-wideband (UWB) power-constrained ad hoc network is given by 2(P ( n=logn) ), where P is the per-nod...
Xiaojun Tang, Yingbo Hua
FOCS
2004
IEEE
15 years 3 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
15 years 12 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
OPODIS
2007
15 years 1 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...