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: Wednesday, June 15, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Pankaj Agarwal (Duke University)

Optimal Coresets for Approximating the Extent of Shallow Levels

We prove that for any set P of n points in Rd and parameters k, ε>0, one can compute a subset of P of size O(k/ε(d-1)/2) that ε-approximates the k-level extent measure of P, and this bound is tight in the worst case. We can construct such a subset P in time O(n+k2d-1).

(Joint work with Hai Yu)

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