<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="MSHTML 6.00.2800.1170" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT face=Arial size=2><FONT face="Times New Roman" size=3>CENTRO DI
RICERCA MATEMATICA ENNIO DE GIORGI<BR><BR>Bimestre su "Probabilita' e
Meccanica Statistica nella Scienza
<BR>dell'Informazione"<BR><BR>
III settimana: 16-20 Giugno<BR><BR><BR>Centro De Giorgi<BR>Collegio
Puteano<BR>Piazza dei Cavalieri, 3<BR>PISA<BR><BR>Sala Conferenze (Aula
2)<BR><BR>Lun. 16:<BR>11-12.30: David Forney (MIT, Cambridge), Introduction to
Modern Coding <BR>Theory - I<BR><BR>14.30-16.30: Giorgio Parisi (Univ. Roma “La
Sapienza”), Progresses in <BR>combinatorial optimization<BR><BR>Mar.
17:<BR>9.30-10.30: Nicolas Sourlas (ENS, Paris), Introduction to the
<BR>Statistical Mechanics of Error-Correction Codes<BR>11-12.30: David Forney
(MIT, Cambridge), Introduction to Modern Coding <BR>Theory - II<BR><BR>14.30-16:
Haggai Kfir (Bar Ilan University, Ramat-Gan), Statistical <BR>Mechanics Aspects
of Joint Source Channel Coding<BR><BR>Mer. 18:<BR>9.30-10.30: Andrea
Montanari (ENS, Paris), Proliferation of pure states <BR>in coding
problems with practical consequences)<BR>11-12: Rudiger Urbanke (EPFL,
Lausanne), To Be Announced<BR><BR>14.30-15.30: Chandra Nair, with Balaji
Prabhakar, Mayank Sharma <BR>(Stanford University, Palo Alto), A Proof of the
Parisi and <BR>Coppersmith-Sorkin Conjectures for the Finite Random Assignment
Problem<BR><BR>Giov. 19:<BR>9.30-10.30: Sekhar Tatikonda (Yale, New Haven),
Inference and Gibbs <BR>Measures 11-12: Marc Mezard (Université de Paris Sud,
Orsay), The cavity <BR>method in optimization problems: how message passing can
deal with the <BR>proliferation of metastable states<BR><BR>14.30-15.30:
Riccardo Zecchina (ICTP, Trieste), From Belief Propagation <BR>to Survey
Propagation: a message-passing algorithm for hard <BR>combinatorial
problems<BR><BR>Ven. 20:<BR>9:30-10:30 Martin Wainwright (UC-Berkeley,
Berkeley), Exponential <BR>families, marginal polytopes, and convex relaxations
for approximate <BR>inference<BR>11-12: Pascal Vontobel (UIUC, Urbana), Factor
Graphs and <BR>Static/Dynamical Electrical
Networks</FONT><BR></FONT></DIV></BODY></HTML>