385 search results - page 9 / 77 » A Fast Algorithm for Matrix Balancing |
SODA
2008
ACM
13 years 10 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
JCC
2010
13 years 7 months ago
2010
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...