Department Gathering

GROTESQUE: GROup TESting, QUick and Efficient

Abstract

I'll talk about very fast (almost optimal time-complexity) algorithms for the problem of "group testing", which may be viewed as a non-linear version of "compressive sensing". I'll be shamelessly using (and taking credit for) the pretty slides developed (after multiple iterations) by my student CAI Sheng, who's been doing some very interesting work on sparse recovery problems in general. Along the way, I'll use the opportunity of having a bunch of captive PG students who can't escape in the audience, to expound on my philosophies for giving good talks/teaching/networking/research life in general. If nothing else, at least you'll be getting free food -- sounds like a fair exchange to me!

Back