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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 17, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Leonidas Guibas (Stanford Univ.)

Structure from Proximity in Point Data

Proximity and distance estimates among a set of sample points can be used to derive useful information about the underlying space these points were sampled from. We'll show through three examples how such metric information allows us to perform efficiently tasks as different as shape recognition in data analysis, collision detection in physical simulations, and routing or information discovery in sensor networks.

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

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