Workshops
Review Meeting (First Year)
The review meeting will take place 14/15 December 2011 at
ETH Zürich in Room
HG F 26.1 of the main building (the main entrance is at the top of the linked floor plan). There will be a registration fee of CHF 85 (EUR 70). Please be prepared to pay in cash, either in CHF or in EUR. Registration includes all coffee breaks and the conference dinner on Wednesday night.
Agenda
Day 1 (14. December)
8.30 - 9.00 Briefing of the reviewers (reviewers and PO only)
9.15 - 10.00 Overview (deviations, where they came from and how they have impacted the project in term of use of resources, man power and time schedule --- including discussion)
10.00 - 10.30 Coffee break
10.30 - 11.15 Scientfic overwiew WP1 (Frederic Chazal)
11.15 - 12.00 Scientfic overwiew WP2 (Bernd Gärtner)
12.15 - 13.00 Talk by Christos Papadimitriou: Non-constructive proofs and complexity
(Abstract); Room CAB G51. This talk is not officially part of the review meeting, and attendance is voluntary. An alternative is to have an individual lunch.
13.00 - 13.30 Sandwiches will be provided in room CAB G15.2.
13.30 - 14.15 Scientfic overwiew WP3 (Dan Halperin, Frederic Cazals, Gert Vegter)
14.15 - 15.30 Internal discussion by the reviewers/PO
15.30 - ... Feedback from the reviewers/PO for the consortium
CGL Board Meeting
Afternoon: time to explore Zurich
19.30 - Conference Dinner at
Jimmy's Day 2 (15. December) Talks from the consortium (25 minutes + 5 minutes discussion):
- 09.00 -- 09.30: TAU: Michael Hemmer, Motion Planning via Manifold Samples MMS.pdf
- 09.30 -- 10.00: INRIA (Algorithms Biology Structure): Frederic Cazals, Multi-scale analysis of sampled energy landscapes : theory and case-studies in biophysics and optimization
- 10.30 -- 11.00: FUB: Sunayana Ghosh, Approximation of ruled surfaces
- 11.00 -- 11.30: ETH: Sebastian Stich, Gradient-free optimization with Random Pursuit
- 11.30 -- 12.00: INRIA (Geometrica, Sophia): Ramsay Dyer, Stability of Delaunay-type structures for manifolds
- 13.30 -- 14.00: INRIA (Geometrica, Saclay): Marc Glisse, Metric Graph Reconstruction from Noisy Data
- 14.00 -- 14.30: NKUA: Ioannis Emiris: Output-sensitive computation of secondary polytopes' quotients
- 14.30 -- 15.00: FSU: Jens K. Müller, The CGL-SVM --- Theory and Implementation
- 15.30 -- 16.00: RUG: Mathijs Wintraecken, Asymptotic Approximation of Submanifolds of Euclidean Spaces
- 16.00 -- 16.30: TUDO: Melanie Schmidt, Probabilistic k-median clustering in data streams
Coffee breaks from 10.00 -- 10.30 and 15.00 -- 15.30, and lunch break from 12.00 -- 13.30 (participants are on their own).
Participants
- Frederic Cazals (INRIA, ABS)
- Andrea Roth (INRIA, ABS)
- Alix Lheritier (INRIA, ABS)
- Joachim Giesen (FSU)
- Jens Muller (FSU)
- Soren Laue (FSU)
- Frederic Chazal (INRIA, Geometrica (Saclay))
- Marc Glisse (INRIA, Geometrica (Saclay))
- Dan Halperin (TAU)
- Michael Hemmer (TAU)
- Ioannis Emiris (NKUA)
- Vissarion Fisikopoulos (NKUA)
- Jean-Daniel Boissonnat (INRIA, Geometrica (Sophia Antipolis))
- David Cohen Steiner (INRIA, Geometrica (Sophia Antipolis))
- Ramsay Dyer (INRIA, Geometrica (Sophia Antipolis))
- Mariette Yvinec (INRIA, Geometrica (Sophia Antipolis))
- Melanie Schmidt (TUDO)
- Christian Sohler (TUDO)
- Bernd Gartner (ETHZ)
- Christian Lorenz Muller (ETHZ)
- Gunter Rote (FUB)
- Sunayana Ghosh (FUB)
- Gert Vegter (RUG)
- Mathijs Wintraecken (RUG)
CG Learning Kick-off Workshop in Paris (Summer School)
We are organizing a workshop at the Institut Henri Poincare in Paris right before the
27th Annual ACM Symposium on Computational Geometry.
- Dates: 9/10/11 June 2011
- Location: Institut Henri Poincare, Paris
Confirmed speakers:
- Kenneth Clarkson, IBM Almaden Research Center
Topic: Geometric optimization and structure in high dimensions
I. Quadratic programming in the simplex: coresets and sparsity
II. Quick and dirty feature extraction: sampling and sketching
III. Quicker and dirtier quadratic programming: regret bounds and sublinear optimization
- Herbert Edelsbrunner, Instiute of Science and Technology, Austria
Topics: Computational Topology
I. Persistent Homology.
II. Algorithms.
III. Applications.
- Suresh Venkatasubramanian, School of Computing at the University of Utah
Topic: The Geometry of Probability Distributions
I. Distances between distributions: classification and properties ( slides in the attachments).
II. Estimation and dimensionality reduction for distributions ( slides in the attachments).
III. Beyond information theory: metric-aware distances between distributions ( slides in the attachments).
Contributed talks from the CGL consortium and guests:
- Barak Raveh (Tel Aviv University): Exploring and summarizing the high-dimensional space of molecular motions
- Christian Sohler (TU Dortmund): Streaming algorithms for the analysis of massive data sets
- Sören Laue (Friedrich-Schiller-Universität Jena): Theory, algorithms and software for optimization in machine learning
- Christian Lorenz Mueller (ETH Zürich): Variable-metric randomized search heuristics for gradient-free black-box optimization
- Don Sheehy (Carnegie Mellon University): Learning with Nets and Meshes
- Arijit Ghosh (INRIA Sophia Antipolis): Reconstruction and meshing submanifolds ( slides in the attachments)
- Quentin Mérigot (Grenoble University): Estimation of Federer's curvature measures
- Alexandr Andoni (Microsoft Research, Mountain View): Introduction to locality sensitive hashing ( slides in the attachments)
- Rien van de Weijgaert (Rijksuniversiteit Groningen): Topological aspects of the cosmic web
Find the detailed
program as pdf file in the attachments.
Organizing committee:
Registration with Caroline French, INRIA - Sophia Antipolis - REGISTRATION CLOSED
Registration is free of charge but you need to register in order to participate. Registration is on a first come first serve basis as the maximum is 70 participants. Registration
deadline has been 20 May 2011.The maximum number of participants has been reached already but you can still register and we will put you on a waiting list.