Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, June 12, 2008, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Dirk Nowotka (Univ. Stuttgart)
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).
Automatic MiSe System Software Version 1.4803M | admin login