Prof. Emo Welzl and Prof. Bernd Gärtner
|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)
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.
Automatic MiSe System Software Version 1.4803M | admin login