Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
Offered By: IEEE via YouTube
Course Description
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
Tags
Related Courses
Probabilistic Graphical Models 1: RepresentationStanford University via Coursera Computer Security
Stanford University via Coursera Intro to Computer Science
University of Virginia via Udacity Introduction to Logic
Stanford University via Coursera Internet History, Technology, and Security
University of Michigan via Coursera