BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Algorithms and bounds for group testing - Dr Oliver Johnson\, Scho
 ol of Mathematics\, University of Bristol
DTSTART:20160919T140000Z
DTEND:20160919T150000Z
UID:TALK67299@talks.cam.ac.uk
CONTACT:Prof. Ramji Venkataramanan
DESCRIPTION:Group testing was introduced by Dorfman in the 1940s\, and giv
 es a model for isolating a small number of infected members of a larger po
 pulation. I will review recent work on this problem\, and explain some new
  algorithms which can be proved to perform well in certain sparsity regime
 s. To complement this\, I will explain how a channel coding argument of Po
 lyanskiy\, Poor and Verdu gives an upper bound on the success rate that ca
 n be achieved by any non-adaptive algorithm\, by a comparison with a certa
 in statistical hypothesis test. This argument can be modified in the adapt
 ive case\, using ideas from directed information theory\, corresponding to
  channel coding with feedback.
LOCATION:LR6\, Cambridge University Engineering Department
END:VEVENT
END:VCALENDAR