Published in: Dagstuhl Reports, Volume 1, Issue 1 (2011)
Stephan Dahlke, Michael Elad, Yonina Eldar, Gitta Kutyniok, and Gerd Teschke. Sparse Representations and Efficient Sensing of Data (Dagstuhl Seminar 11051). In Dagstuhl Reports, Volume 1, Issue 1, pp. 108-127, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@Article{dahlke_et_al:DagRep.1.1.108, author = {Dahlke, Stephan and Elad, Michael and Eldar, Yonina and Kutyniok, Gitta and Teschke, Gerd}, title = {{Sparse Representations and Efficient Sensing of Data (Dagstuhl Seminar 11051)}}, pages = {108--127}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2011}, volume = {1}, number = {1}, editor = {Dahlke, Stephan and Elad, Michael and Eldar, Yonina and Kutyniok, Gitta and Teschke, Gerd}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.1.108}, URN = {urn:nbn:de:0030-drops-31507}, doi = {10.4230/DagRep.1.1.108}, annote = {Keywords: Efficient signal sensing schemes, sparse signal representations, efficient signal reconstruction algorithms, impact of the methods in neighboring research fields and applications} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Stephan Dahlke, Gabriele Steidl, and Gerd Teschke. The Continuous Shearlet Transform in Arbitrary Space Dimensions. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{dahlke_et_al:DagSemProc.08492.9, author = {Dahlke, Stephan and Steidl, Gabriele and Teschke, Gerd}, title = {{The Continuous Shearlet Transform in Arbitrary Space Dimensions}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--7}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.9}, URN = {urn:nbn:de:0030-drops-19216}, doi = {10.4230/DagSemProc.08492.9}, annote = {Keywords: } }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, and Gerd Teschke. 08492 Abstracts Collection – Structured Decompositions and Efficient Algorithms. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{dahlke_et_al:DagSemProc.08492.1, author = {Dahlke, Stephan and Daubechies, Ingrid and Elad, Michael and Kutyniok, Gitta and Teschke, Gerd}, title = {{08492 Abstracts Collection – Structured Decompositions and Efficient Algorithms}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--18}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.1}, URN = {urn:nbn:de:0030-drops-18860}, doi = {10.4230/DagSemProc.08492.1}, annote = {Keywords: Sparse signal representation, optimal signal reconstruction, approximation, compression} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, and Gerd Teschke. 08492 Executive Summary – Structured Decompositions and Efficient Algorithms. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{dahlke_et_al:DagSemProc.08492.2, author = {Dahlke, Stephan and Daubechies, Ingrid and Elad, Michael and Kutyniok, Gitta and Teschke, Gerd}, title = {{08492 Executive Summary – Structured Decompositions and Efficient Algorithms }}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--5}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.2}, URN = {urn:nbn:de:0030-drops-18851}, doi = {10.4230/DagSemProc.08492.2}, annote = {Keywords: Sparse signal representation, optimal signal reconstruction, approximation, compression} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Michael Elad and Irad Yavneh. A Weighted Average of Sparse Representations is Better than the Sparsest One Alone. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{elad_et_al:DagSemProc.08492.3, author = {Elad, Michael and Yavneh, Irad}, title = {{A Weighted Average of Sparse Representations is Better than the Sparsest One Alone}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--35}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.3}, URN = {urn:nbn:de:0030-drops-18828}, doi = {10.4230/DagSemProc.08492.3}, annote = {Keywords: Sparse representations, MMSE, MAP, mathcing pursuit} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Felix Krahmer, Götz E. Pfander, and Peter Rashkov. An open question on the existence of Gabor frames in general linear position. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{krahmer_et_al:DagSemProc.08492.4, author = {Krahmer, Felix and Pfander, G\"{o}tz E. and Rashkov, Peter}, title = {{An open question on the existence of Gabor frames in general linear position}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--7}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.4}, URN = {urn:nbn:de:0030-drops-18848}, doi = {10.4230/DagSemProc.08492.4}, annote = {Keywords: Gabor systems, erasure channels, time--frequency dictionaries, short--time Fourier transform, uncertainty principle.} }
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Karlheinz Gröchenig and Tomasz Hrycak. Pseudospectral Fourier reconstruction with IPRM. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{grochenig_et_al:DagSemProc.08492.6, author = {Gr\"{o}chenig, Karlheinz and Hrycak, Tomasz}, title = {{Pseudospectral Fourier reconstruction with IPRM}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--3}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.6}, URN = {urn:nbn:de:0030-drops-18830}, doi = {10.4230/DagSemProc.08492.6}, annote = {Keywords: IPRM, Fourier series, inverse methods, pseudospectral methods} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Monika Dörfler and Bruno Torrésani. Representation of Operators in the Time-Frequency Domain and Generalzed Gabor Multipliers. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{dorfler_et_al:DagSemProc.08492.7, author = {D\"{o}rfler, Monika and Torr\'{e}sani, Bruno}, title = {{Representation of Operators in the Time-Frequency Domain and Generalzed Gabor Multipliers}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--28}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.7}, URN = {urn:nbn:de:0030-drops-18808}, doi = {10.4230/DagSemProc.08492.7}, annote = {Keywords: Operator approximation, generalized Gabor multipliers, spreading function, twisted convolution} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Thorsten Raasch. Sparse Reconstructions for Inverse PDE Problems. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{raasch:DagSemProc.08492.8, author = {Raasch, Thorsten}, title = {{Sparse Reconstructions for Inverse PDE Problems}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--8}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.8}, URN = {urn:nbn:de:0030-drops-18784}, doi = {10.4230/DagSemProc.08492.8}, annote = {Keywords: Adaptivity, sparse reconstructions, l1 minimization, parameter identification} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Anita Tabacco. Time-Frequency Analysis and PDE's. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{tabacco:DagSemProc.08492.10, author = {Tabacco, Anita}, title = {{Time-Frequency Analysis and PDE's}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--4}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.10}, URN = {urn:nbn:de:0030-drops-18792}, doi = {10.4230/DagSemProc.08492.10}, annote = {Keywords: Fourier multipliers, modulation spaces, short-time Fourier transform} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Stephan Dahlke, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. 06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{dahlke_et_al:DagSemProc.06391.1, author = {Dahlke, Stephan and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.}, title = {{06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--21}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.1}, URN = {urn:nbn:de:0030-drops-8782}, doi = {10.4230/DagSemProc.06391.1}, annote = {Keywords: Computational complexity, partial information, high-dimensional problems, operator equations, non-linear approximation, quantum computation, stochastic computation, ill posed-problems} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Klaus Meer and Martin Ziegler. Real Computational Universality: The Word Problem for a class of groups with infinite presentation. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{meer_et_al:DagSemProc.06391.2, author = {Meer, Klaus and Ziegler, Martin}, title = {{Real Computational Universality: The Word Problem for a class of groups with infinite presentation}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.2}, URN = {urn:nbn:de:0030-drops-8773}, doi = {10.4230/DagSemProc.06391.2}, annote = {Keywords: Computational group theory, word problem, Blum-Shub-Smale model} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Howard Barnum. Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{barnum:DagSemProc.06391.3, author = {Barnum, Howard}, title = {{Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--25}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06391.3}, URN = {urn:nbn:de:0030-drops-8769}, doi = {10.4230/DagSemProc.06391.3}, annote = {Keywords: Quantum query complexity semidefinite programming} }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Erich Novak, Stephan Dahlke, and Winfried Sickel. Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{novak_et_al:DagSemProc.04401.12, author = {Novak, Erich and Dahlke, Stephan and Sickel, Winfried}, title = {{Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings}}, booktitle = {Algorithms and Complexity for Continuous Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.12}, URN = {urn:nbn:de:0030-drops-1471}, doi = {10.4230/DagSemProc.04401.12}, annote = {Keywords: elliptic operator equation , worst case error , linear approximation method , nonlinear approximation method , best n-term approximation Bernstein widths , manifold widths} }
Feedback for Dagstuhl Publishing