385 search results - page 2 / 77 » A Fast Algorithm for Matrix Balancing |
WALCOM
2008
IEEE
13 years 7 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
JACM
2002
13 years 5 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
COCOON
2009
Springer
14 years 6 days ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix m...