Deterministic sparse fourier approximation via fooling arithmetic progressions

COLT 2010 - The 23rd Conference on Learning Theory

Volumn , Issue , 2010, Pages 381-393

  Akavia, Adi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC PROGRESSIONS; DETERMINISTIC ALGORITHMS; ENTIRE DOMAIN; FOURIER APPROXIMATIONS; FOURIER COEFFICIENTS; ORACLE ACCESS; ROBUST ALGORITHM; UNIFORM DISTRIBUTION;

FOURIER ANALYSIS; WAVEFORM ANALYSIS;

APPROXIMATION ALGORITHMS;

EID: 84894738603     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A. Akavia, S. Goldwasser, and S. Safra. Proving Hard-Core Predicates using List Decoding. In Proc. of 44th IEEE Annual Symposium on Foundations of Computer Science (FOCS'03), pages 146-157. IEEE Computer Society, 2003.
2. M. Ajtai, H. Iwaniec, J. Komlos, J. Pintz, and E. Szemeredi. Constructions of a this set with small fourier coefficients. Bull. London Math. Soc., 22:583-590, 1990.
3. A. Akavia. Solving Hidden Number Problem with One Bit Oracle and Advice. In proceedings of the 29th Annual International Cryptology Conference (Crypto'09), 2009.
4. N. Alon and Y. Mansour. ε-discrepancy sets and their application for interpolation of sparse polynomials. IPL: Information Processing Letters, 54, 1995.
5. G. Cormode and S. Muthukrishnan. Towards an algorithmic theory of compressed sensing. In DIMACS TR: 2005-25, 2005.
6. G. Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. In Paola Flocchini and Leszek Gasieniec, editors, SIROCCO, Volume 4056 of Lecture Notes in Computer Science, pages 280-294. Springer, 2006.
7. E. J. Candes, J. K. Romberg, and T. Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52(2):489-509, 2006.
8. J.W. Cooley and J.W. Tukey. An algorithm for machine calculation of complex fourier series. Mathematics of Computation, 19:297-301, Apr 1965.
9. R. A. DeVore. Deterministic constructions of compressed sensing matrices. J. Complex., 23(4-6):918-925, 2007.
10. D. Donoho. Compressed sensing. IEEE Trans. on Information Theory, 42(4):1289-1306, April, 2005.
11. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss. Near-optimal sparse fourier representations via sampling. In Proc. of 34 ACM Annual Symposium on Theory of Computing (STOC'02), pages 152-161. ACM Press, 2002.
12. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proc. 27th ACM Annual Symposium on Theory of Computing (STOC'89), pages 25-32, 1989.
13. 1 via expander codes. In SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 353-362, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
14. Sumit Ganguly and Anirban Majumder. Crprecise: A deterministic summary structure for update data streams. CoRR, abs/cs/0609032, 2006.
15. A. C. Gilbert, S. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal sparse fourier representation via sampling. In in Proc. SPIE Wavelets XI, 2005.
16. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin. Algorithmic linear dimension reduction in the l1 norm for sparse vectors. CoRR, abs/cs/0608079, 2006.
17. P. Indyk. Sketching, streaming and sub-linear space algorithms. Graduate course notes, available at http://stellar.mit.edu/s/course/6/fa07/6,895/, 2007.
18. P. Indyk. Explicit constructions for compressed sensing of sparse signals. In SODA'08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 30-33, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
19. M. A. Iwen and C. V. Spencer. Improved bounds for a deterministic sublinear-time sparse fourier algorithm. In Conference on Information Sciences and Systems (CISS), Princeton, NJ, 2008.
20. M. A. Iwen. A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. CoRR, abs/0708.1211, 2007.
21. M. A. Iwen. A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. In SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 20-29, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
22. M. Katz. An estimate for characters sum. J. AMS, 2(2):197-200, 1989.
23. E. Kushilevitz and Y. Mansour. Learning decision trees using the Fourier spectrum. SICOMP, 22(6):1331-1348, 1993.
24. Y. Mansour. Randomized interpolation and approximation of sparse polynomials. SIAM J. on Computing, 24(2):357-368, 1995.
25. S. Muthukrishnan. Data streams: Algorithm and applications (invited talk at soda'03). available at http://athos.rutgers.edu/muthu/stream-1-1.ps, 2003.
26. A. Razborov, E. Szemeredi, and A. Wigderson. Constructing small sets that are uniform in arithmetic progressions. Combinatorics, Probability & Computing, 2:513-518, 1993.
27. Terence Tao and Van H. Vu. Additive Combinatorics. Series: Cambridge Studies in Advanced Mathematics (No. 105), September 2006.