MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Small Data -- Linear Time Algorithms for Geometric Problems

Sariel Har-Peled
Talk

(http://sarielhp.org/):

Sariel Har-Peled did his phd in Tel-Aviv University under the supervision of Micha Sharir. After graduating in 99, he spent a year being a postdoc in Duke University. In 2000 he joined UIUC CS department, where he is currently a professor. In 2011, the AMS published his book on geometric approximation algorithms. He lives under the perpetual fear that the winter is coming.
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI  
AG Audience
English

Date, Time and Location

Monday, 29 September 2014
13:00
60 Minutes
E1 4
024
Saarbrücken

Abstract

In this talk we would review some recent techniques developed to solve/approximate geometric problems in linear time. Such techniques include not only the (traditional) sampling approach, but also the extraction of coresets, and aggressive pruning and summarizing of data.

Contact

Erich Reindel
302 58091
--email hidden
passcode not visible
logged in users only

Mona Linn, 09/24/2014 10:01 -- Created document.