Algorithms and bounds for group testing

Add to your list(s) Download to your calendar using vCal

• Dr Oliver Johnson, School of Mathematics, University of Bristol
• Monday 19 September 2016, 15:00-16:00
• LR6, Cambridge University Engineering Department.

If you have a question about this talk, please contact Prof. Ramji Venkataramanan.

Group testing was introduced by Dorfman in the 1940s, and gives a model for isolating a small number of infected members of a larger population. I will review recent work on this problem, and explain some new algorithms which can be proved to perform well in certain sparsity regimes. To complement this, I will explain how a channel coding argument of Polyanskiy, Poor and Verdu gives an upper bound on the success rate that can be achieved by any non-adaptive algorithm, by a comparison with a certain statistical hypothesis test. This argument can be modified in the adaptive case, using ideas from directed information theory, corresponding to channel coding with feedback.

This talk is part of the Signal Processing and Communications Lab Seminars series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge University Engineering Department Talks
• Cambridge talks
• Centre for Smart Infrastructure & Construction
• Chris Davis' list
• Computational Continuum Mechanics Group Seminars
• Featured lists
• Information Engineering Division seminar list
• Interested Talks
• LR6, Cambridge University Engineering Department
• School of Technology
• Signal Processing and Communications Lab Seminars
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.