Sciweavers

555 search results - page 32 / 111
» Sparse Topical Coding
Sort
View
LCPC
1998
Springer
13 years 11 months 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...
BIBM
2007
IEEE
13 years 11 months ago
Multi-topic Aspects in Clinical Text Classification
This paper investigates multi-topic aspects in automatic classification of clinical free text. In many practical situations, we need to deal with documents overlapping with multip...
Yutaka Sasaki, Brian Rea, Sophia Ananiadou
TFM
2009
Springer
136views Formal Methods» more  TFM 2009»
14 years 2 months ago
On Teaching Formal Methods: Behavior Models and Code Analysis
Abstract. Teaching formal methods is a challenging task for several reasons. First, both the state-of-the-art knowledge and the tools are rapidly evolving. Second, there are no com...
Jan Kofron, Pavel Parizek, Ondrej Sery