Sciweavers

335 search results - page 29 / 67
» Non-negative sparse coding
Sort
View
TIT
2010
112views Education» more  TIT 2010»
14 years 4 months ago
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by ran
In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n >...
David L. Donoho, Jared Tanner
NN
2008
Springer
115views Neural Networks» more  NN 2008»
14 years 9 months ago
The state of MIIND
MIIND (Multiple Interacting Instantiations of Neural Dynamics) is a highly modular multi-level C++ framework, that aims to shorten the development time for models in Cognitive Neu...
Marc de Kamps, Volker Baier, Johannes Drever, Mela...
CISS
2008
IEEE
15 years 4 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
IPPS
2007
IEEE
15 years 4 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
SPAA
1998
ACM
15 years 1 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang