Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

IEEE via YouTube

Overview

Explore a 22-minute IEEE conference talk delving into combinatorial group testing and sparse recovery schemes, focusing on achieving near-optimal decoding time. Learn about the research conducted by Mahdi Cheraghchi from the University of Michigan-Ann Arbor and Vasileios Nakos from Saarland University, as they present their findings on innovative approaches to optimize these critical areas of study. Gain insights into the latest advancements in algorithmic efficiency and their potential applications in various fields of computer science and information theory.

Syllabus

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.