Sciweavers

334 search results - page 28 / 67
» On Shift-Invariant Sparse Coding
Sort
View
LCPC
1998
Springer
14 years 4 days ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
TIT
2010
112views Education» more  TIT 2010»
13 years 2 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»
13 years 7 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
14 years 2 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
14 years 2 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