Haitham Al-Hassanieh just sent me the following:
Thanks for the nice blog. I wanted to let you know that we have recently organized a workshop on "Recent Developments in the Sparse Fourier Transform" at the FOCS'14 conference.
The slides of the talks are posted online and might be of interest to the readers of your blog.
Here is a link to the workshop page:
Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology
From the page:
FOCS 2014 Workshop on The Sparse Fourier Transform:
Theory and Applications
Date: Saturday, October 18, 2014.
Location: Radisson Blu Warwick Hotel, Philadelphia, PA, USA.
Organizers: Anna Gilbert, Piotr Indyk, and Dina Katabi
Description:The workshop is dedicated to the theory and applications of efficient algorithms for finding large Fourier coefficients. This question is of longstanding interest in TCS. Recently, the topic has attracted considerable attention in applied computer science, electrical engineering and applied mathematics. The goal of the workshop is to facilitate interactions between these areas and disseminate recent developments and ideas related to this topic.
Time Speaker Title Session 1 9:00-9:40 am Eric Price
(University of Texas at Austin)
Overview of Sparse Fourier Transform Algorithms
9:40-10:05 am Anna Gilbert
(University of Michigan, Ann Arbor)
Discrete Inverse Problems and Fourier Sampling
10:05-10:30 am Mark Iwen
(Michigan State University)
Computing Sparse Chebyshev and Legendre Coefficient Expansions via SFTs
10:30-11:00 am Coffee Break Session 2 11:00-11:45 am Kannan Ramchandran
(University of California, Berkeley)
Sparse Fourier Transforms Based on Sparse-Graph Alias Codes
11:45-12:30 am Haitham Hassanieh (MIT)
Dina Katabi (MIT)
Overview of Sparse Fourier Transform Applications
[SLIDES PART 1]
12:30-2:00 pm Lunch Break Session 3 2:00-3:00 pm Eric Blais
(University of Waterloo)
Overview of Fourier sampling Over the Boolean cube
3:00-3:30 pm Ankur Moitra
The Threshold for Super-resolution
Bonus Talk Monday 10:40 am Michael Kapralov
Sample-Optimal Fourier Sampling in Any Constant Dimension
[SLIDES] (as a part of the regular FOCS program)
Sparse FFT Webpage: http://groups.csail.mit.edu/netmit/sFFT/index.html Algorithms and Signal Processing Course: https://stellar.mit.edu/S/course/6/fa14/6.893/materials.html
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.