Sciweavers

385 search results - page 7 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
TPDS
2002
94views more  TPDS 2002»
13 years 7 months ago
Recursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
IPPS
1999
IEEE
14 years 3 days ago
LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping an...
Andrei Radulescu, Arjan J. C. van Gemund, Hai-Xian...
ECML
2006
Springer
13 years 11 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
SIAMMAX
2010
98views more  SIAMMAX 2010»
13 years 2 months ago
Improved Balanced Incomplete Factorization
In this paper we improve the BIF algorithm which computes simultaneously the LU factors (direct factors) of a given matrix, and their inverses (inverse factors). This algorithm was...
Rafael Bru, José Marín, José ...
FOCS
2010
IEEE
13 years 5 months ago
Replacement Paths via Fast Matrix Multiplication
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
Oren Weimann, Raphael Yuster