132 search results - page 11 / 27 » Sparse Boolean Matrix Factorizations |
SPAA
1998
ACM
15 years 2 months ago
1998
ACM
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...
ICFCA
2009
Springer
15 years 4 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a blind dereverberation method designed to recover the subband envelope of an original speech signal from its reverberant version. The problem is formulated as...
100
click to vote
LCPC
1998
Springer
15 years 2 months ago
1998
Springer
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...