%0 Conference Paper %1 conf/dagstuhl/EladY08 %A Elad, Michael %A Yavneh, Irad %B Structured Decompositions and Efficient Algorithms %D 2008 %E Dahlke, Stephan %E Daubechies, Ingrid %E Elad, Michael %E Kutyniok, Gitta %E Teschke, Gerd %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany %K dblp %T A Weighted Average of Sparse Representations is Better than the Sparsest One Alone. %U http://dblp.uni-trier.de/db/conf/dagstuhl/P8492.html#EladY08 %V 08492

@inproceedings{conf/dagstuhl/EladY08, added-at = {2018-08-23T00:00:00.000+0200}, author = {Elad, Michael and Yavneh, Irad}, biburl = {https://www.bibsonomy.org/bibtex/25afdd473d5896bd17fe17f6cbc607b19/dblp}, booktitle = {Structured Decompositions and Efficient Algorithms}, crossref = {conf/dagstuhl/2008P8492}, editor = {Dahlke, Stephan and Daubechies, Ingrid and Elad, Michael and Kutyniok, Gitta and Teschke, Gerd}, ee = {http://drops.dagstuhl.de/opus/volltexte/2009/1882/}, interhash = {900fa9d01af5b0bc408e3d0cb25218a2}, intrahash = {5afdd473d5896bd17fe17f6cbc607b19}, keywords = {dblp}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, series = {Dagstuhl Seminar Proceedings}, timestamp = {2024-04-09T10:25:15.000+0200}, title = {A Weighted Average of Sparse Representations is Better than the Sparsest One Alone.}, url = {http://dblp.uni-trier.de/db/conf/dagstuhl/P8492.html#EladY08}, volume = 08492, year = 2008 }