Sciweavers

2563 search results - page 31 / 513
» Parallel matrix algorithms and applications
Sort
View
ICPADS
2002
IEEE
14 years 2 months ago
Adaptive Matrix Multiplication in Heterogeneous Environments
In this paper, an adaptive matrix multiplication algorithm for dynamic heterogeneous environments is developed and evaluated. Unlike the state-of-the-art approaches, where load ba...
Bo Hong, Viktor K. Prasanna
IPPS
1999
IEEE
14 years 2 months ago
Sparse Matrix Block-Cyclic Redistribution
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterizati...
Gerardo Bandera, Emilio L. Zapata
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
13 years 11 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
ISPDC
2010
IEEE
13 years 8 months ago
Pretty Good Accuracy in Matrix Multiplication with GPUs
—With systems such as Road Runner, there is a trend in super computing to offload parallel tasks to special purpose co-processors, composed of many relatively simple scalar proc...
Matthew Badin, Lubomir Bic, Michael B. Dillencourt...
JCP
2008
171views more  JCP 2008»
13 years 9 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen