230 search results - page 42 / 46 » Sparse matrix factorization on massively parallel computers |
112
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
142
click to vote
ICS
2011
Tsinghua U.
14 years 4 months ago
2011
Tsinghua U.
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
156
click to vote
ICPP
1995
IEEE
15 years 4 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
121
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
In many scientific applications, significant time is spent tuning codes for a particular highperformance architecture. Tuning approaches range from the relatively nonintrusive (...
110
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...