BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1513
DTSTAMP:20250204T062811Z
SUMMARY:Group testing: A survey
DESCRIPTION:Speaker: Sidharth Jaggi (University of Bristol)\n\nAbstract: \n
 Group testing is the problem of inferring a (hopefully) small subset of it
 ems/individuals of interest from a large populations via pooled/group tes
 ts — test outcomes are positive if and only if the pool being tested con
 tains at least one item/individual of interest. Canonical examples include
  identifying diseased individuals in a population\, item identification in
  RFID systems\, identification of defective products in industrial systems
 \, and streaming algorithms. The theory and algorithms also offer insights
  into more general non-linear sparse inverse problems. In this talk I'll s
 urvey some classical fundamental bounds and algorithms for a variety of mo
 dels\, and present some recent results.\nShort Bio:\nSidharth (Sid) Jaggi 
 (B.Tech. IIT Bombay 2000\, M.S./Ph.D. CalTech 2006\, all in electrical eng
 ineering\, post-doctoral associate MIT 2006). He joined The Chinese Univer
 sity of Hong Kong in 2007\, and the School of Mathematics at the Universit
 y of Bristol in 2020\, where he is currently a Professor of Information an
 d Coding Theory. His research group (somewhat unwillingly) calls itself th
 e CAN-DO-IT Team (Codes\, Algorithms\, Networks: Design and Optimization f
 or Information Theory). Topics he has worked in include sparse recovery/gr
 oup-testing\, covert communication\, network coding\, and adversarial chan
 nels.\n
URL:https://www.tcs.tifr.res.in/web/events/1513
DTSTART;TZID=Asia/Kolkata:20250211T160000
DTEND;TZID=Asia/Kolkata:20250211T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR