Sciweavers

6897 search results - page 462 / 1380
» Parallelization of Modular Algorithms
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 5 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
MMM
2005
Springer
163views Multimedia» more  MMM 2005»
15 years 10 months ago
Parallel Image Matrix Compression for Face Recognition
The canonical face recognition algorithm Eigenface and Fisherface are both based on one dimensional vector representation. However, with the high feature dimensions and the small ...
Dong Xu, Shuicheng Yan, Lei Zhang, Mingjing Li, We...
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
15 years 10 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
SPAA
2010
ACM
15 years 9 months ago
Multi-sided shared coins and randomized set-agreement
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Keren Censor Hillel
IPPS
1998
IEEE
15 years 8 months ago
Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
Peter Sulatycke, Kanad Ghose