6105 search results - page 378 / 1221 » A Parallel Algorithm for Bound-Smoothing |
177
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
183
click to vote
OPODIS
2010
15 years 4 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
195
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
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...
208
click to vote
MMM
2005
Springer
16 years 11 days ago
2005
Springer
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 ...
198
click to vote
FCCM
2006
IEEE
16 years 26 days ago
2006
IEEE
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...