default search action
Dagstuhl Seminar Proceedings: Structured Decompositions and Efficient Algorithms 2008
- Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, Gerd Teschke:
Structured Decompositions and Efficient Algorithms, 30.11. - 05.12.2008. Dagstuhl Seminar Proceedings 08492, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 - Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, Gerd Teschke:
08492 Abstracts Collection - Structured Decompositions and Efficient Algorithms. - Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, Gerd Teschke:
08492 Executive Summary - Structured Decompositions and Efficient Algorithms. - Michael Elad, Irad Yavneh:
A Weighted Average of Sparse Representations is Better than the Sparsest One Alone. - Felix Krahmer, Götz E. Pfander, Peter Rashkov:
An open question on the existence of Gabor frames in general linear position. - Martin Ehler, Simone Geisel:
Arbitrary Shrinkage Rules for Approximation Schemes with Sparsity Constraints. - Karlheinz Gröchenig, Tomasz Hrycak:
Pseudospectral Fourier reconstruction with IPRM. - Monika Dörfler, Bruno Torrésani:
Representation of Operators in the Time-Frequency Domain and Generalzed Gabor Multipliers. - Thorsten Raasch:
Sparse Reconstructions for Inverse PDE Problems. - Stephan Dahlke, Gabriele Steidl, Gerd Teschke:
The Continuous Shearlet Transform in Arbitrary Space Dimensions. - Anita Tabacco:
Time-Frequency Analysis and PDE's.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.