385 search results - page 48 / 77 » A Fast Algorithm for Matrix Balancing |
SIAMCOMP
2010
13 years 4 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
QEST
2005
IEEE
14 years 3 months ago
2005
IEEE
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
NOMS
2008
IEEE
14 years 4 months ago
2008
IEEE
—Storage Area Networks (SANs) connect storage devices to servers over fast network interconnects. We consider the problem of optimal SAN configuration with the goal of meeting s...
ICIP
1999
IEEE
14 years 2 months ago
1999
IEEE
by 0. In the discrete Fourier transform (DFT) domain, We propose a hybrid approach to wavelet-based image deconvolution that comprises Fourier-domain system inversion followed by w...