WebDiarios de Motocicleta

Informatics Weekly, written by Mihai Pătraşcu.

Saturday, September 8, 2007

Love thy predecessor (IV): Approx Nearest Neighbor

›
The message of this post is: Predecessor search is equivalent to (1+ε)-approximate nearest neighbor in any constant dimension d . Perhaps th...
Wednesday, September 5, 2007

Top 10 Theory Impact

›
Rasmus asks for a Top 10 list of theory results that have had a profound impact outside theory. Especially, he wants such a list with resul...
9 comments:
Tuesday, September 4, 2007

Chernoff about STOC/FOCS

›
There is a constant stream of attacks on the CS publication model -- especially by Math purists, I feel. I have certainly seen a lot of comm...
4 comments:
Monday, September 3, 2007

Love thy predecessor (III): van Emde Boas

›
The data structure of van Emde Boas is by every definition a classic: it is solving a fundamental problem optimally (see my paper with Mi...
5 comments:
Friday, August 31, 2007

Led Zeppelin

›
I have typically not been alarmed by the prospects of oil running out. Europe has shown that railroads can work, so personally I couldn'...
2 comments:
Thursday, August 30, 2007

Love thy predecessor (II): The comparison model

›
As mentioned already, the super-standard way to solve the predecessor problem is by binary search. This has led people to define the compari...
4 comments:

Love thy predecessor (I): In the beginning was the Word

›
Thinking about the predecessor problem is the CS-equivalent of a journey within, when you rediscover the very axioms of your existence. It i...
5 comments:
‹
›
Home
View web version
Powered by Blogger.