Sciweavers

247 search results - page 19 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 7 months ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan
SJ
2010
158views more  SJ 2010»
13 years 2 months ago
Efficient Utilization of Renewable Energy Sources by Gridable Vehicles in Cyber-Physical Energy Systems
The main sources of emission today are from the electric power and transportation sectors. One of the main goals of a cyber-physical energy system (CPES) is the integration of rene...
A. Y. Saber, Ganesh K. Venayagamoorthy
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 4 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
INFOCOM
2006
IEEE
14 years 1 months ago
Impact of Mobility on the Performance of Relaying in Ad Hoc Networks
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...
IPL
2006
110views more  IPL 2006»
13 years 7 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway