Sciweavers

23 search results - page 1 / 5
» Near-optimal sparse fourier representations via sampling
Sort
View
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 7 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 ...
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
14 years 5 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
MOBICOM
2012
ACM
11 years 7 months ago
Faster GPS via the sparse fourier transform
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr ...
ICIP
2010
IEEE
13 years 2 months ago
Image modeling and enhancement via structured sparse model selection
An image representation framework based on structured sparse model selection is introduced in this work. The corresponding modeling dictionary is comprised of a family of learned ...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...
CISS
2008
IEEE
13 years 11 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer