Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Martin Ehler and Simone Geisel. Arbitrary Shrinkage Rules for Approximation Schemes with Sparsity Constraints. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{ehler_et_al:DagSemProc.08492.5, author = {Ehler, Martin and Geisel, Simone}, title = {{Arbitrary Shrinkage Rules for Approximation Schemes with Sparsity Constraints}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8492}, editor = {Stephan Dahlke and Ingrid Daubechies and Michal Elad and Gitta Kutyniok and Gerd Teschke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.5}, URN = {urn:nbn:de:0030-drops-18816}, doi = {10.4230/DagSemProc.08492.5}, annote = {Keywords: Frames, shrinkage, variational problems, sparse approximation} }
Feedback for Dagstuhl Publishing