Sciweavers

7006 search results - page 561 / 1402
» Approximation Algorithms
Sort
View
190
Voted
CISS
2010
IEEE
14 years 10 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 7 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
190
Voted
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
16 years 9 days ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
ICCAD
1995
IEEE
108views Hardware» more  ICCAD 1995»
15 years 10 months ago
Partitioning and reduction of RC interconnect networks based on scattering parameter macromodels
This paper presents a linear time algorithm to reduce a large RC interconnect network into subnetworks which are approximated with lower order equivalent RC circuits. The number o...
Haifang Liao, Wayne Wei-Ming Dai
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 9 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...