Many computational tasks can be naturally modeled as geometric problems in high-dimensional spaces. Data sets in areas such as optimization, computer vision, machine learning or statistics often live in spaces of dimensionality in the order of thousands or millions. However, geometric algorithms and data structures often require time or space that is exponential in the dimension.
Overcoming this "curse of dimensionality" has been a subject of extensive research over the last few decades.
The goal of the summer school is to provide an in-depth introduction to some of the key problems and techniques in high-dimensional geometric computing. The school will cover topics such as linear programming, algorithms for spaces with low intrinsic dimension, high-dimensional combinatorics and similarity search. A number of interesting open problems in the area will also be highlighted.
The school will be taught by experts in the area of high-dimensional geometric computing:
Alexandr Andoni (Microsoft Research Silicon Valley)
Ken Clarkson (IBM Research)
Thomas Dueholm Hansen (Aarhus University)
Piotr Indyk (MIT)
Nati Linial (Hebrew University)
The summer school will take place on August 8-11, 2011 at Center for Massive Data Algorithmics (MADALGO) and Center for the Theory of Interactive Computation (CTIC) in the Department of Computer Science, Aarhus University, Denmark.
The school is targeted at graduate students, as well as researchers interested in an in-depth introduction to high-dimensional geometric computing.
The capacity of the summer school is limited. Prospective participants should register using the online registration form available here as soon as possible. Registering graduate students must also have their supervisor send a letter confirming their graduate student status directly to Gerth Brodal: email@example.com; the subject line of the email should be 'student_last_name/SS_2011/confirming'. Registration is on a first-come-first-serve basis and will close on Tuesday August 2, 2011.
Registration is free; handouts, coffee breaks, lunches and a dinner will be provided by MADALGO, CTIC and Aarhus University.
Gerth S. Brodal (MADALGO, Aarhus University)
Lars Arge (MADALGO, Aarhus University)
Peter Bro Miltersen (CTIC, Aarhus University)
Piotr Indyk (MADALGO, MIT)
Dorthe Haagen Nielsen (CTIC, Aarhus University)
Else Magård (MADALGO, Aarhus University)
Jan Frederiksen (Aarhus University)
Matie Bach Søgaard (MADALGO, Aarhus University)
Center for Massive Data Algorithmics is a major basic research center funded by the Danish National Research Foundation. The center is located at the Department of Computer Science, Aarhus University, Denmark, but also includes researchers at CSAIL, Massachusetts Institute of Technology in the US, and at the Max Planck Institute for Informatics and at Frankfurt University in Germany. The center covers all areas of the design, analysis and implementation of algorithms and data structures for processing massive data (interpreted broadly to cover computations where data is large compared to the computational resources), but with a main focus on I/O-efficient, cache-oblivious and data stream algorithms.
Center for the Theory of Interactive Computation is a Sino-Danish research center funded by the Danish National Research Foundation and by the Chinese National Natural Science Foundation of China (NFSC). The center is a tight collaboration between the Computer Science Department at Aarhus University, Denmark and IIIS, Tsinghua University, Beijing, China. Research within the center focuses on four related areas of theoretical computer science:
Computational Complexity Theory,
Cryptography, Quantum Informatics, and Algorithmic Game Theory.
MADALGO - Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation / Department of Computer Science / Aarhus University