Previous Conferences & Workshops

Oct
04
2010

Computer Science/Discrete Mathematics Seminar I

Super-uniformity of the typical billiard path (proof included)
Jozsef Beck
11:15am|S-101

I will describe the proof of the following surprising result: the typical billiard paths form the family of the most uniformly distributed curves in the unit square. I will justify this vague claim with a precise statement. As a byproduct, we obtain...

Sep
30
2010

Short Talks by Postdoctoral Members

Sparce Approximation of PSD Matrices
2:15pm|S-101

I will discuss the problem of approximating a given positive semidefinite matrix A , written as a sum of outer products vv^T , by a much shorter weighted sum in the same outer products. I will then mention an application to sparsification of finite...

Sep
28
2010

Computer Science/Discrete Mathematics Seminar II

High-Rate Codes with Sublinear Time Decoding
10:30am|S-101

Locally decodable codes are error-correcting codes that admit efficient decoding algorithms, that can recover any bit of the original message by looking at only a small number of locations of a corrupted codeword. The tradeoff between the rate of a...