Pitching to VCs (comic)
Usability Nightmare: Xfce Settings ManagerRant: Why can't anyone make a good settings screen?
Why don't web browsers do this?Why don't web pages start as fast as this computer from 1984?
Experiment: Deleting a post from the InternetOnce you post something on the Internet, it is hard to get rid of it. As an experiment, I deleted one of my past posts, and I tried to remove all traces of it.
Detecting C++ memory leaksIt's fairly simple to redefine malloc() and free() to your own functions, to track the file and line number of memory leaks.
Throw away the keys: Easy, Minimal Perfect HashingPerfect hashing is a technique for building a hash table with no collisions in the minimum possible space. They are a easy to build with this simple python function.
How QBASIC almost got me killedThe day arrived when my project was ready to be unleashed upon the world. I waited until the teacher was hovering nearby and then I started my application, running the FORMAT command on the network drive. Some classmates were watching the screen and she hurried over to see what all the fuss was about.
VP trees: A data structure for finding stuff fastLet's say you have millions of pictures of faces tagged with names. Given a new photo, how do you find the name of person that the photo most resembles?
In the cases I mentioned, each record has hundreds or thousands of elements: the pixels in a photo, or patterns in a sound snippet, or web usage data. These records can be regarded as points in high dimensional space. When you look at a points in space, they tend to form clusters, and you can infer a lot by looking at ones nearby.