Sparse - PDFSEARCH.IO - Document Search Engine

Sparse
Results: 1782

#	Item
691	High-Rate Sparse Superposition Codes with Iteratively Optimal Estimates Add to Reading List Source URL: www.stat.yale.edu Language: English - Date: 2012-10-24 17:56:15
692	The 2nd CHiME Workshop on Machine Listening in Multisource Environments Vancouver, Canada, June 1st, 2013 THE TUM+TUT+KUL APPROACH TO THE 2ND CHIME CHALLENGE: MULTI-STREAM ASR EXPLOITING BLSTM NETWORKS AND SPARSE NMF Add to Reading List Source URL: spandh.dcs.shef.ac.uk Language: English - Date: 2013-03-20 07:12:33
693	Representation Learning for Sparse, High Dimensional Multi-Label Classification Ryan Kiros1 , Axel J. Soto2 , Evangelos Milios2 , and Vlado Keselj2 1 Department of Computing Science, University of Alberta Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-12-26 22:59:55
694	APPROXIMATE ITERATIVE BAYES OPTIMAL ESTIMATES FOR HIGH-RATE SPARSE SUPERPOSITION CODES Sanghee Cho and Andrew Barron Department of Statistics, Yale University, New Haven, CTUSA e-mail: {sanghee.cho, andrew.barron} Add to Reading List Source URL: www.me.inf.kyushu-u.ac.jp Language: English - Date: 2014-01-08 19:57:15
695	Better size estimation for sparse matrix products? Rasmus Resen Amossen, Andrea Campagna, and Rasmus Pagh IT University of Copenhagen, DK-2300 Copenhagen S, Denmark {resen,acam,pagh}@itu.dk Add to Reading List Source URL: rasmus.resen.org Language: English - Date: 2010-09-27 07:56:06
696	DELFT UNIVERSITY OF TECHNOLOGY REPORTSolving Large Sparse Linear Systems Efficiently on Grid Computers using an Asynchronous Iterative Method as a Preconditioner Add to Reading List Source URL: www.ewi.tudelft.nl Language: English - Date: 2011-05-11 08:17:01
697	Shift-Invariant Sparse Coding for Audio Classification Roger Grosse Computer Science Dept. Stanford University Stanford, CA 94305 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2015-06-03 15:15:50
698	ADAPTIVE SAMPLING FOR SPARSE RECOVERY Ali Tajer and H. Vincent Poor Department of Electrical Engineering, Princeton University, Princeton, NJEmail: {tajer, poor}@princeton.edu ABSTRACT Consider n data sequences, e Add to Reading List Source URL: www.helsinki.fi Language: English - Date: 2011-08-02 04:32:04
699	A Fast Approximation Algorithm for Tree-Sparse Recovery Chinmay Hegde, Piotr Indyk, Ludwig Schmidt1 Massachusetts Institute of Technology Abstract—Sparse signals whose nonzeros obey a tree-like Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2015-05-25 21:19:33
700	K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance∗ Piotr Indyk Eric Price Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2011-06-05 23:48:27

UPDATE