Sciweavers

107 search results - page 17 / 22
» Lower Bounds for Sparse Recovery
Sort
View
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Blind Estimation of Multiple Carrier Frequency Offsets
Multiple carrier-frequency offsets (CFO) arise in a distributed antenna system, where data are transmitted simultaneously from multiple antennas. In such systems the received sign...
Yuanning Yu, Athina P. Petropulu, H. Vincent Poor,...
CDC
2010
IEEE
140views Control Systems» more  CDC 2010»
13 years 2 months ago
On the observability of linear systems from random, compressive measurements
Abstract-- Recovering or estimating the initial state of a highdimensional system can require a potentially large number of measurements. In this paper, we explain how this burden ...
Michael B. Wakin, Borhan Molazem Sanandaji, Tyrone...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
INFOCOM
2003
IEEE
14 years 20 days ago
An information theoretic view of network management
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
Tracey Ho, Muriel Médard, Ralf Koetter
WIOPT
2010
IEEE
13 years 5 months ago
Throughput-delay-reliability tradeoff in ad hoc networks
Abstract—Delay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repe...
Rahul Vaze