
Sign up to save your podcasts
Or


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
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
Monolithic commodity operating systems (OSes), like Windows, Mac OS X, Linux, and FreeBSD, lack sufficient protection mechanisms with which to adhere to Critical information protection design principles. Today we will learn about the nested kernel architecture, a new OS organization that provides important security benefits to commodity operating systems that was retrofitted to an existing monolithic kernel. We will learn how the nested kernel architecture can efficiently support useful write-mediation policies, such as write-once and append-only, which OS developers can use to incorporate new security policies with very low performance overheads. Our guest today is Dr. Nathan Dautenhahn, Assistant Professor of Computer Science at Rice University.
From the publisher's feed