www.cgc.ethz.ch |
No CGC colloquium in Summer 2003.
Winter 2002/03 |
Time: Mondays, 14:15 - 15:45
Location: IFW B42
(unless stated otherwise)
Organizers: CGC
faculty at ETH Zurich
Contact: Emo Welzl
<emo@inf.ethz.ch>
Monday, November 25, 2002, 14:15 - 15:45, IFW B42
Hans-Andrea Loeliger
Monday, December 02, 2002, 14:15 - 15:45, IFW B42
Naveen Garg
ETH Zürich
Factor graphs are graphical models with origins in coding theory.
Closely related graphical models are Bayesian networks and Markov
random fields; there are also close relations to basic notions in
system theory. The sum-product algorithm (also called ``belief
propagation''), which operates by message passing in the factor graph,
subsumes many important algorithms in coding, signal processing, and
artificial intelligence. We present these fundamentals and give
several examples of ongoing research in signal processing.
IIT Delhi / MPI Saarbrücken
In this talk I will present a fully polynomial time approximation
scheme (FPTAS) for the optimum fractional solution to the Steiner
forest problem. This can easily be generalized to obtain an FPTAS for
a hitting set problem on a collection of clutters. The algorithm is
very simple to describe and has a running time better than those of
existing algorithms. For clutters that do not satisfy the MFMC
property (e.g., k-spanner, multicommodity flows,
T-cuts, T-joins etc.), this is the only algorithm
known (other than the generic algorithms for linear programming) for
solving such hitting set problems.
Last modified on 2003-01-09 20:06:10 by Falk Tschirschnitz <tschirsc@inf.ethz.ch> | Copyright © 2000-2001 |