Do you think we will get another 64MB USB keychain this year? 
Just a reminder that the CS Department is sponsoring the
GRAD STUDENT APPRECIATION TG on Friday, April 29 –
5:00 PM in the NSH Atrium.Please come to be appreciated by the faculty, and to
celebrate the end of classes, the start of exams, summer,
or anything else that floats your boat!Good food — Mad Mex!
Good drink — a variety!See you there!
Don’t let Keanu Reeves steal the focus!
This is an excellent tutorial on Singular Value Decomposition (SVD) by Todd Will from UW-La Crosse. I highly recommend it for everybody who deals with Linear Algebra.
http://www.uwlax.edu/faculty/will/svd/index.html
Among other excellent insights, once you read the page on Perpframes, Aligner and Hangers (the 3rd page in that site), you will never see a matrix the same way again. It’s like the, erh, blue pill. (Or is it the red one? :P)
From arXiv cs daily comes a very interesting paper titled Online Medians via Online Bribery by Marek Chrobak, Claire Kenyon, John Noga and Neal E. Young. Here is part of the abstract:
Our proofs reduce online medians to the following online bribery problem: faced with some unknown threshold T>0, an algorithm must submit “bids” b>0 until it submits a bid as large as T. The algorithm pays the sum of its bids. We describe optimally competitive algorithms for online bribery.
I suppose this can be a useful skill when I travel to some parts of the world later this summer?
Full information:
Read the rest of this entry »
Sometimes it’s very handy if you define your own math operator and have it behave like other
LaTeX math functions (such as \log). Here is an example of how you can do it:
\DeclareMathOperator{\poly}{poly}
Once defined, you can simply write $O(2^k \poly(n))$ instead of $O(2^k \text{poly}(n))$.
Neat eh?
