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, November 10, 2011, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Martin Jaggi

Structured Sparsity

The study of sparse solutions to some optimization problems (e.g. underdetermined linear systems) has lead to many interesting new applications in the last few years. This approach is known as compressed sensing, or group testing. The main observation is that very often, this specific class of (hard) combinatorial problems can be solved very efficiently by solving an (easy) convex relaxation of the problem instead.

Here we will discuss a recent generalization of the measure of "sparsity", allowing to incorporate the structure of the underlying solutions, as proposed by

Guillaume Obozinski, Laurent Jacob and Jean-Philippe Vert,

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