23 search results - page 1 / 5 » Near-optimal sparse fourier representations via sampling |
110
Voted
STOC
2012
ACM
13 years 20 days ago
2012
ACM
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...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
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...
94
Voted
MOBICOM
2012
ACM
13 years 21 days ago
2012
ACM
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...
93
Voted
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
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 ...
94
Voted
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
—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...