This week, I’m at the Workshop on Algorithms for Data Streams in Dortmund, Germany. It’s a continuation in spirit of the great Kanpur workshops from 2006 and 2009.

The first day went very well despite the widespread jet lag (if only jet lag from those traveling from the east could cancel out with those traveling from the west.) Sudipto Guha kicked things off with a talk on combinatorial optimization problems in the (multiple-pass) data stream model. There was a nice parallel between Sudipto’s talk and a later talk by David Woodruff and both were representative of a growing number of papers that have used ideas developed in the context of data streams to design more efficient algorithms in the usual RAM model. In the case of Sudipto’s talk, this was a faster algorithm to approximate -matchings while David’s result was a faster algorithm for least-squares regression.

Other talks included Christiane Lammersen presenting a new result for facility location in data streams; Melanie Schmidt talking about constant-size coresets for -means and projective clustering; and Dan Feldman discussing the data stream challenges that arise when trying to transform real-time GPS data from your smart-phone into a human-readable diary of your life. I spoke about work on constructing a combinatorial sparsifier for an -dimensional graph via a single random linear projection into roughly dimensions. Rina Panigrahy wrapped things up with an exploration of different distance measures in social networks, i.e., how to quantify how closely-connected you are to your favorite celebrity. This included proposing a new measure based on the probability that two individuals remained connected if every edge was deleted with some probability. He then related this to electrical resistance and spectral sparsification. He refused to be drawn on which of his co-authors had the closest connection to the Kardashians.

**To be continued…** Tomorrow, Suresh will post about day 2 across at the Geomblog.

### Like this:

Like Loading...

*Related*

## 3 comments

Comments feed for this article

July 29, 2012 at 8:17 pm

Data Streaming in Dortmund: Day 3 « the polylogblog[...] Dortmund Workshop on Algorithms for Data Streams, here are the happens for Day 3. Previous posts: Day 1 and Day [...]

September 17, 2012 at 9:44 am

Thought this was cool: Streaming Data Mining Tutorial slides (and more) « CWYAlpha[...] Day 1 at Data Streaming in Dortmund: [...]

February 6, 2013 at 6:01 pm

Best Computer Science Blogs of 2012[...] to Begin: Read Data Streaming in Dortmund: Day 1, in which the author chronicles his trip to Germany for a workshop on algorithms for data [...]