Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Noa Elad, Satyen Kale, and Joseph (Seffi) Naor. Online Semidefinite Programming. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 40:1-40:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{elad_et_al:LIPIcs.ICALP.2016.40, author = {Elad, Noa and Kale, Satyen and Naor, Joseph (Seffi)}, title = {{Online Semidefinite Programming}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.40}, URN = {urn:nbn:de:0030-drops-63205}, doi = {10.4230/LIPIcs.ICALP.2016.40}, annote = {Keywords: online algorithms, semidefinite programming, primal-dual} }
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, 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} }
Feedback for Dagstuhl Publishing