Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

Voted

DAGSTUHL
2007

76views Software Engineering» more DAGSTUHL 2007»

A Fast Algorithm for Matrix Balancing

15 years 4 months ago

A Fast Algorithm for Matrix Balancing

Download www.cerfacs.fr

Philip A. Knight, Daniel Ruiz

Real-time Traffic

DAGSTUHL 2007 | Software Engineering |

claim paper

Related Content

» A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Applic...

» Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

» Fast and Accurate Phylogeny Reconstruction Algorithms Based on the MinimumEvolution Princi...

» Parallel Computation of the Eigenstructure of ToeplitzplusHankel Matrices on Multicomputer...

» A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Rando...

» Probe Matrix Problems Totally Balanced Matrices

» Fast contextfree grammar parsing requires fast boolean matrix multiplication

» A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

» Fast matrix multiplication is stable

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	DAGSTUHL
Authors	Philip A. Knight, Daniel Ruiz

Comments (0)