Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 12, 2016, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Christian Schneebeli
For my bachelor thesis I studied two classes of probabilistic algorithms: The Hit & Run algorithms and the Shake & Bake algorithms. Both classes were applied to sample from the boundary of a convex polytope. I will present the result of several computational experiments comparing the methodes in terms of speed and stability. Finally, I will show possible ways to improve Clarkson's algorithm for solving the redundancy problem.
Automatic MiSe System Software Version 1.4803M | admin login