Erratum to: Sparse Representation Shape ModelsYUELONG LI; JUFU FENG; LI MENG et al.Journal of mathematical imaging and vision. 2014, Vol 48, Num 1, issn 0924-9907, p. 92Article

Determining biosonar images using sparse representationsFONTAINE, Bertrand; PEREMANS, Herbert.The Journal of the Acoustical Society of America. 2009, Vol 125, Num 5, pp 3052-3059, issn 0001-4966, 8 p.Article

New inequalities on sparse representation in pairs of basesXU GUANLEI; WANG XIAOTONG; ZHOU LIJIA et al.IET signal processing (Print). 2013, Vol 7, Num 8, pp 674-683, issn 1751-9675, 10 p.Article

Probabilistic analysis for basis selection via <script small 1>_p diversity measuresWIPF, David P; RAO, Bhaskar D.ICASSP. 2004, isbn 0-7803-8484-9, vol II, 801-804Conference Paper

Optimal sparse representations in general overcomplete basesMALIOUTOV, Dmitry M; CETIN, Müjdat; WILLSKY, Alan S et al.ICASSP. 2004, isbn 0-7803-8484-9, vol II, 793-796Conference Paper

Two Conditions for Equivalence of 0-Norm Solution and 1-Norm Solution in Sparse RepresentationYUANQING LI; AMARI, Shun-Ichi.IEEE transactions on neural networks. 2010, Vol 21, Num 7, pp 1189-1196, issn 1045-9227, 8 p.Article

Applications of Sparse Representation & Compressive SensingBARANIUK, Richard G; CANDES, Emmanuel J; ELAD, Michael et al.Proceedings of the IEEE. 2010, Vol 98, Num 6, issn 0018-9219, 198 p.Serial Issue

An efficient variable selection approach for analyzing designed experimentsYUAN, Ming; JOSEPH, V. Roshan; LIN, Yi et al.Technometrics. 2007, Vol 49, Num 4, pp 430-439, issn 0040-1706, 10 p.Article

Development of TRIP : Fast Sparse Multivariate Polynomial Multiplication Using Burst TriesGASTINEAU, Mickaël; LASKAR, Jacques.Lecture notes in computer science. 2006, pp 446-453, issn 0302-9743, isbn 3-540-34379-2, 8 p.Conference Paper

Polynomials that sign represent parity and descartes rule of signsBASU, Saugata; BHATNAGAR, Nayantara; GOPALAN, Parikshit et al.IEEE Conference on Computational Complexity. 2004, pp 223-235, isbn 0-7695-2120-7, 1Vol, 13 p.Conference Paper

Low complexity method for DOA estimation using array covariance matrix sparse representationHE, Z. Q; LIU, Q. H; JIN, L. N et al.Electronics letters. 2013, Vol 49, Num 3, pp 228-230, issn 0013-5194, 3 p.Article

Orthogonal matching pursuit with DCD iterationsZAKHAROV, Y. V; NASCIMENTO, V.Electronics letters. 2013, Vol 49, Num 4, pp 295-297, issn 0013-5194, 3 p.Article

Uniformization of discrete dataLEI YANG.Lecture notes in computer science. 2005, pp 453-462, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Fast simulation of VLSI interconnectsJAIN, Jitesh; KOH, Cheng-Kok; BALAKRISHNAN, Venkataramanan et al.IEEE/ACM International Conference on Computer-Aided Design. 2004, isbn 0-7803-8702-3, 2Vol, vol1, 93-98Conference Paper

Blind Compressed SensingGLEICHMAN, Sivan; ELDAR, Yonina C.IEEE transactions on information theory. 2011, Vol 57, Num 10, pp 6958-6975, issn 0018-9448, 18 p.Article

Array pattern synthesis using sparse representation of beampatternHE, R; XU, D. J; SHEN, F et al.Electronics letters. 2012, Vol 48, Num 23, pp 1444-1446, issn 0013-5194, 3 p.Article

An Inter-Prediction Method Using Sparse Representation for High Efficiency Video Coding : Smart Multimedia & Communication SystemsINOUE, Koji; ISECHI, Kohei; SAITO, Hironobu et al.IEICE transactions on fundamentals of electronics, communications and computer science. 2013, Vol 96, Num 11, pp 2191-2193, issn 0916-8508, 3 p.Conference Paper

General design algorithm for sparse frame expansionsSKRETTING, Karl; HUSOY, John Hakon; AASE, Sven Ole et al.Signal processing. 2006, Vol 86, Num 1, pp 117-126, issn 0165-1684, 10 p.Article

Margin-sparsity trade-off for the set covering machineLAVIOLETTE, Francois; MARCHAND, Mario; SHAH, Mohak et al.Lecture notes in computer science. 2005, pp 206-217, issn 0302-9743, isbn 3-540-29243-8, 1Vol, 12 p.Conference Paper

A note on signed binary window algorithm for elliptic curve cryptosystemsFANYU KONG; DAXING LI.Lecture notes in computer science. 2005, pp 223-235, issn 0302-9743, isbn 3-540-30849-0, 1Vol, 13 p.Conference Paper

Optimal sparse representations for blind source separation and blind deconvolution : A learning approachBRONSTEIN, Michael M; BRONSTEIN, Alexander M; ZIBULEVSKY, Michael et al.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol3, 1815-1818Conference Paper

Analysis of generalised orthogonal matching pursuit using restricted isometry constantYI SHEN; BO LI; WENLEI PAN et al.Electronics letters. 2014, Vol 50, Num 14, pp 1020-1022, issn 0013-5194, 3 p.Article

Adaptive variable step algorithm for missing samples recovery in sparse signalsSTANKOVIC, Ljubiša; DAKOVIC, Miloš; VUJOVIC, Stefan et al.IET signal processing (Print). 2014, Vol 8, Num 3, pp 246-256, issn 1751-9675, 11 p.Article

Single-shot compressive imagingSTERN, Adrian; RIVENSON, Yair; JAVIDI, Bahram et al.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 67780J.1-67780J.8, issn 0277-786X, isbn 978-0-8194-6938-0Conference Paper

Convergent SDP-relaxations for polynomial optimization with sparsityLASSERRE, Jean B.Lecture notes in computer science. 2006, pp 263-272, issn 0302-9743, isbn 3-540-38084-1, 1Vol, 10 p.Conference Paper