Constrained Counting with Jeff Dudek

Constrained counting is a fundamental problem in artificial intelligence, with applications in probabilistic reasoning, inexact computing, and statistical physics. In today's episode, we will learn about research at Rice which studies how graph decompositions and tensor network contraction can be used to solve constrained counting problems. Welcome to Unconventional Computing, a Rice University Computer Science podcast! I'm Cannon Lewis, your host and a Ph.D. student in the Computer Science Department here at Rice. My guest on today's special, grad-student-only episode is Jeff Dudek. Jeff is a Ph.D. student in the Computer Science Department working in the field of machine learning with Professor Moshe Vardi. For more information, please visit CS. Rice.edu

You can listen to Constrained Counting with Jeff Dudek online on Radio and Podcast. Open the player on this page to stream the available audio.

Constrained Counting with Jeff Dudek is an episode from Unconventional Computing by Rice University Computer Science.

This episode is 30:50 long.

This episode was published on Dec 21, 2018.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Unconventional Computing when more episodes are available from the podcast feed.