Daniel Lemire's blog

, 2 min read

How to speed up retrieval without any index?

3 thoughts on “How to speed up retrieval without any index?”

  1. Will says:

    Very nice paper, Daniel.

  2. In a related vein, you might enjoy Jonathan Shewchuk’s work on Fast Robust Predicates for Computational Geometry:

    http://www.cs.cmu.edu/~quake/robust.html

  3. eamonn keogh says:

    Nice!

    While I got my PhD at UCI, I am now at UCR, and I did all the LB_Keogh stuff there.

    While it is true that I have “applied LB_Keogh to just about every time series problem you can think of” It is worth noting that at least 100 others have applied it to problems. see http://www.cs.ucr.edu/~eamonn/LB_Keogh.htm