Math club is streaming Donald Knuth's lecture today!

Hi,
we will be streaming the Christmas tree lecture by Donald Knuth, Stanford, tonight 12/8/2011 from 6:30-7:30PM at OC4611.

"Description:
Bayesian trees and BDDs
Professor Knuth will present his 17th Annual Christmas Tree Lecture on Thursday, December 8, 2011 at 6:30 pm in NVIDIA Auditorium in the new Huang Engineering Center, 475 Via Ortega, Stanford University . For those unable to come to Stanford, the lecture will be broadcast online as a free webinar. If you would like to view the live broadcast, please register so that we can send you the link prior to the event.
Prepare to experience Professor Knuth's sense of humor and unique perspective on computer science.
"Formally speaking, a Bayesian network based on an n-node binary tree is a way of assigning probabilities to each state x of the entire tree, where x is an n-bit vector whose jth bit is the state of node j. The overall probability of state x is proportional to the product, over all pairs of nodes j and k with j the parent of k, of a given weight function that depends only on the current states of nodes j and k. This local weight function can be different at each pair of adjacent nodes. Standard methods of belief propagation are able to compute the global probability of simple events such as "node x is in state 0", without doing much work. But more complicated events, such as "the sum of all individual states is m", cannot be handled efficiently by traditional techniques. The speaker will explain how to apply elementary BDD technology so that the probability of such events (and many others) can be computed in polynomial time.
– Don Knuth
Professor Knuth is the Professor Emeritus of the Art of Computer Programming at Stanford University. Dr. Knuth's classic programming texts include his seminal work The Art of Computer Programming, Volumes 1-3, widely considered to be among the best scientific writings of the century. "

We hope to see you tonight,
Math Club