186 search results - page 25 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
SIAMMAX
2010
13 years 2 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
PDP
2008
IEEE
14 years 1 months ago
2008
IEEE
Matrix computation algorithms often exhibit dependencies between neighboring elements inside loop nests such that the frontier between computed elements and those to be computed w...
TSP
2010
13 years 2 months ago
2010
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
EUROPAR
2000
Springer
13 years 11 months ago
2000
Springer
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...