|Modules||S4C1 / MA-INF 12055|
|Degree program||Computer Science / Mathematics Master, 2nd semester|
|Lecturer||Prof. Dr. Anne Driemel|
This seminar is directed at students enrolled in the Mathematics Master as well as students enrolled in the Computer Science Master. The kick-off meeting for the seminar will take place on Wednesday, April 3rd, 2019, at 10:15 am, in room 2.078 in the Computer Science Building at Endenicher Allee 19 A.
The task is as follows:
|24.5.||10:00||2.007||Bourgain's embedding||Linus Behm|
|24.5.||10:45||2.007||Lower bounds via counting||Carolin Kaffine|
|24.5.||13:15||2.007||Embedding into the line||Jan Hitzschke|
|24.5.||14:00||2.007||Embedding the Hausdorff distance||Jure Taslak|
|26.6.||10:00||2.007||Johnson-Lindenstrauss Lemma I||Oliver Kiss|
|26.6.||10:45||2.007||Johnson-Lindenstrauss Lemma II||Adrian De Lon|
|26.6.||11:30||2.007||Volume-respecting embeddings||Jakobus Conradi|
|28.6.||10:00||2.007||Embeddings into Trees||Lukas Dreyer|
|28.6.||10:45||2.007||Planar-graph metrics ?||Koen van Greevenbroek|
|28.6.||11:30||2.007||Doubling metrics||Max Gläser|
An n-point metric space (X,D) is an n-set X and a metric D, which can be defined by a table of distances between pairs of points of X. Metric embeddings provide compact representations for such metric spaces while at the same time preserving the metric up to some distortion. Such representations have numerous applications in computer science, if they exist. The starting point of our study is the survey by Indyk and Matousek from 2002 (revised version with Sidiropoulos from 2017). The plan is to study some fundamental results described in the survey together with more recent literature in the state of the art of the field.