Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 11, 2003, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Kaspar Fischer
In his paper "Rounding of polytopes in the real number model of computation", Khachiyan describes a simple algorithm to find a (1+eps)-approximation to the smallest enclosing ellipsoid of a point set S in d-dimensional space.
In this talk, I present the algorithm and the convex program behind it and mention the problems we experienced when we implemented the algorithm.
Automatic MiSe System Software Version 1.4803M | admin login