Finding top-N items in a stream
Wednesday, July 4th, 2007How 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.