Posted by: atri | April 21, 2010

Lecture 39: Data stream algorithms

In Monday’s lecture, we first saw how the Guruswami-Sudan algorithm can solve the more general problem of list recovery. Then we looked at data stream algorithms: in particular, we considered the problem of top-k or finding the “hot items.”

In today’s lecture, we will see a connection between the hot items problem and group testing.

Addendum (4/23): Here is a very nice survey on data stream algorithm by Muthukrishnan.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: