Sciweavers

43264 search results - page 111 / 8653
» Comparing models of computation
Sort
View
CSE
2009
IEEE
14 years 8 days ago
A Comparative Study of Blocking Storage Methods for Sparse Matrices on Multicore Architectures
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...
CSR
2008
Springer
13 years 10 months ago
Comparing Universal Covers in Polynomial Time
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...
Jirí Fiala, Daniël Paulusma
PPAM
2005
Springer
14 years 2 months ago
A Web Computing Environment for Parallel Algorithms in Java
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 ...
ICPR
2008
IEEE
14 years 10 months ago
Comparative analysis of registration based and registration free methods for cancelable fingerprint biometrics
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....
ICPR
2006
IEEE
14 years 10 months ago
Comparative Analysis of Decision-level Fusion Algorithms for 3D Face Recognition
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,...
Berk Gökberk, Lale Akarun