Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login