Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, September 24, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Primoz Skraba (INRIA Saclay, France)

Persistent Homology and Clustering

This talk will center around persistent homology or simply persistence; an important tool for the analysis of large and high dimensional data sets, especially point clouds. Particularly, the talk will present recent work on applying persistence to the problem of clustering. The algorithm we end up with is practical and comes with theoretical guarantees. On the theoretical side, I will discuss the stability of the persistent clusters and on the practical side I will show how it aids in interpreting data which may be difficult to visualize.

Joint work with Frederic Chazal, Steve Oudot and Leonidas Guibas.

Primoz Skraba obtained a PhD in Electrical Engineering from Stanford University in 2009 as part of the Geometric Computing Group. His research interests lie in Computational Topology and Wireless Sensor Networks. He is currently a post-doctoral researcher with the Geometrica Group at INRIA-Saclay in France.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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