We address the freerider problem on P2P networks. We first propose a specific participation metric, which we call a peer’s EigenTrust score. We show that EigenTrust scores accu...
Sepandar D. Kamvar, Mario T. Schlosser, Hector Gar...
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
I propose a set of criteria which distinguish a grand challenge in science or engineering from the many other kinds of short-term or long-term research problems that engage the int...
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
The future mobile and ubiquitous computing world will need new forms of information sharing and collaboration between people. In this paper we present iClouds, an architecture for ...
Andreas Heinemann, Jussi Kangasharju, Fernando Lya...
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...