8669 search results - page 28 / 1734 » Computing matrix representations |
SIAMSC
2008
13 years 7 months ago
2008
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
ICPP
2008
IEEE
14 years 2 months ago
2008
IEEE
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
JMLR
2012
11 years 10 months ago
2012
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...
FOCS
2000
IEEE
14 years 2 days ago
2000
IEEE
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
IANDC
2000
13 years 7 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...