Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer ...
Cancelable biometric systems are gaining in popularity for use in person authentication for applications where the privacy and security of biometric templates are important consid...
Achint Oommen Thomas, Nalini K. Ratha, Jonathan H....
3D shape-based face recognition algorithms can be improved by using decision-level fusion algorithms. In this work, we present a comparative analysis of various fusion algorithms,...