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, March 17, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jared Tanner (University of Oxford)

Parallel-l0, a fully parallel algorithm for combinatorial compressed sensing

We consider the problem of solving for the sparsest solution of large underdetermined linear system of equations where the matrix is the adjacency matrix of an expander graph corresponding with at most d neighbours per node. We present a new combinatorial compressed sensing algorithm with provable recovery guarantees, fully parallel with computational runtime less than traditional compressed sensing algorithms, and able to recover sparse signals beyond l1-regularization. This work is joint with Rodrigo Mendoza-Smith.

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