ClickThroughs on an implementation mentioned here on Nuit Blanche
Think of Nuit Blanche as a crossroad. Often times, I request access to implementations so that you can become a rockstar (Nobody Cares About You and Your Algorithm ), Back in May, I asked Kannan Ramchandran and Sameer Pawar about whether an implementation of their paper
( Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity ) would be out. I wrote about their answer:
"Kannan t[old] me ...that an implementation should be out by the end of the summer. woohoo! "
Sameer and Kannan followed through on that e-mail this week with:
It's been a while since we communicated. At our end, we have made some development towards making the implementation of FFAST accessible to the people. Although we promised a summer- release of the code, it took us more time to get C++ implementation ready than we estimated. To release the FFAST code to general public still needs some more work in terms of web/user interface. But to get started we thought we can at least release it to you. So for now, we have created a guest login account to one of our servers at Berkeley. You can login remotely as follows:....
Unfortunately, I don't have much time to kick the tires on this implementation but Kannan let me know that if you want to have access to the FFAST implementation as is, you can do so by directly contacting Sameer directly at: firstname.lastname@example.org
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.