Tadeusz Pietraszek

© 2004-2007 Tadeusz Pietraszek

«
»

Finding top-N items in a stream

How to (approximately) generate a top-N items list without counting the number of occurrences of all instances? Two interesting papers I found on the topic: http://citeseer.ist.psu.edu/charikar02finding.html and http://citeseer.ist.psu.edu/jin03dynamically.html. I also somebody’s seminar powerpoint presentation explaining it.

This entry was posted on Wednesday, July 4th, 2007 at 11:22 pm and is filed under Progs/Tools/Libs. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

6 Responses to “Finding top-N items in a stream”

  1. Berdan Says:
    January 29th, 2010 at 5:13 pm

    helpfull….

  2. direk izle Says:
    January 29th, 2010 at 5:14 pm

    thanks for sharing

  3. komik izle Says:
    January 29th, 2010 at 5:15 pm

    thanks for informations

  4. web hosting Says:
    January 29th, 2010 at 5:15 pm

    hope somebody will explain it

  5. rüya görmek Says:
    January 29th, 2010 at 5:16 pm

    thank so much……….

  6. Knight Online Says:
    January 29th, 2010 at 5:17 pm

    see knights here

Leave a Reply