144 search results - page 2 / 29 » Improved Approximation Guarantees for Sublinear-Time Fourier... |
148
Voted
CISS
2008
IEEE
15 years 10 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...
148
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
135
Voted
STACS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
182
Voted
STOC
2012
ACM
13 years 6 months 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...
137
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...