253 search results - page 4 / 51 » Data structures in Java for matrix computations |
LCPC
1998
Springer
13 years 10 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...
IEEEMSP
2002
IEEE
13 years 10 months ago
2002
IEEE
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
SCIA
2009
Springer
14 years 10 days ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
BMCBI
2010
13 years 5 months ago
2010
Background: Selective pressure in molecular evolution leads to uneven distributions of amino acids and nucleotides. In fact one observes correlations among such constituents due t...