Nuit Blanche has a nice summary of the FOCS 2012 53rd Annual IEEE Symposium on Foundations of Computer Science Workshop on “Randomized Numerical Linear Algebra (RandNLA): Theory and Practice“. Faster random algorithms for QR, SVD, Eigenvalues, Least Squares, … using random projections and other techniques were discussed.
You are currently browsing the monthly archive for May 2013.
The last week of classes and finals week were kind of brutal both for me and my students. (It wasn’t that bad, but it was a lot of work.) So, I’m taking some time off blogging. Cheers, Hein