321 search results - page 5 / 65 » Implementing Randomized Matrix Algorithms in Parallel and Di... |
CLUSTER
2006
IEEE
15 years 8 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
118
Voted
WWW
2010
ACM
15 years 9 months ago
2010
ACM
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has repeatedly shown the usefulness of extracting the interaction structure inside dya...
124
click to vote
PPL
2002
15 years 1 months ago
2002
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...
117
Voted
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
134
click to vote
IRREGULAR
1995
Springer
15 years 5 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...