Sciweavers

132 search results - page 4 / 27
» Sparse Boolean Matrix Factorizations
Sort
View
JMLR
2012
11 years 9 months ago
NIMFA: A Python Library for Nonnegative Matrix Factorization
NIMFA is an open-source Python library that provides a unified interface to nonnegative matrix factorization algorithms. It includes implementations of state-of-the-art factoriza...
Marinka Zitnik, Blaz Zupan
LATIN
2010
Springer
14 years 1 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
EUROPAR
2003
Springer
14 years 9 days ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro
IJDMB
2007
119views more  IJDMB 2007»
13 years 7 months ago
Simulation study in Probabilistic Boolean Network models for genetic regulatory networks
: Probabilistic Boolean Network (PBN) is widely used to model genetic regulatory networks. Evolution of the PBN is according to the transition probability matrix. Steady-state (lon...
Shuqin Zhang, Wai-Ki Ching, Michael K. Ng, Tatsuya...