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: Monday, May 09, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Carsten Lange (FU Berlin)

Optimal topological simplification of discrete functions on surfaces

A widely considered problem is to separate "noise" from "important" information of a function obtained from measured data. But how can we quantify noise? One approach called "persistence theory" uses topological quantities to distinguish between important and less important information. In our set-up, we want to find a perturbation of a given function f on a surface that is close to a f and has as few critical points as possible. This is achieved by combining Forman's discrete Morse theory with Edelsbrunner's persistence theory.

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