Around Compressive Sensing in 80 hours

I go away for a week and baaammm, three outfits offer jobs related to compressive sensing: INRIA, MERL and EPFL.

In the meantime, congratulations to Zhilin. Bob summarized the speed-ups in OMP implementations. Danny still deals with very large SVDs. Maxim reflects on ITA's papers or at least some of them. Muthu talks about Softwaring while David talks about Solving single-digit Sudoku subproblems.

On the LinkedIn Compressive Sensing group that boast 1351 members, some questions still need answers:

• I asked about efficient approaches to solve min ||Dx-a||, s.t. ||x|| <=1, with 1-norms, and D diagonal and nonnegative? (D and a are known).
• Virginie asked about Sparse Channels and CP Length
• Ziyuan asked about  \ell_{1,\infty} regularization

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.