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: Thursday, June 12, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Dirk Nowotka (Univ. Stuttgart)

When the Maximum Intersection Problem Is Easy: On the Use of Threshold Phenomena in Randomized Graph Models

Given a computational problem over an input set equipped with a probability distribution. Which are suitable properties of such a distribution for the construction of fast algorithms? In particular, we consider data mining problems where the input is modelled by random graphs. We want to discuss this problem field in the seminar starting from an example where we use that approach by showing that the maximum intersection problem can be efficiently solved when the input follows the so called Zipf's law. The maximum intersection problem consists of the task to find for a given set q a set q' from a given collection D of sets such that q and q' have an intersection of maximum size among all sets in D (all sets and D are finite).

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