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: Tuesday, October 09, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Yves Brise

On the Autocorrelation of Sets of Disks

We consider a collection of $n$ disjoint disks in $\mathbb{R}^1$ or $\mathbb{R}^2$. We are interested in the so called autocorrelation of this collection, which is the intersection area of the disks with a copy of themselves, if we translate the copy by a vector $t$. Obviously, the autocorrelation is a function in $t$. The concept of autocorrelation has applications mainly in interferometry and signal processing.

The general optimization problem that we are investigating, consists of resizing the disks in such a way that the autocorrelation function is always greater than a given threshold $\mu$, for a given range of $t$. The measure of optimality is just the sum of the radii of the disks, which we want to minimize.

In this talk, I present polynomial time algorithms for some simplified variants of the above problem, and I will discuss some (partial) results about the hardness of the general problem.

Joint work with Bernd Gärtner, Trung Nguyen.

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