186 search results - page 18 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
EUROPAR
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...