6105 search results - page 391 / 1221 » A Parallel Algorithm for Bound-Smoothing |
182
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we present new approaches to high performance protein database scanning on two novel massively parallel architectures to gain supercomputer power at low cost. The ï¬...
171
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
185
click to vote
FSE
1993
Springer
15 years 11 months ago
1993
Springer
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
196
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Pattern recognition and computer vision tasks are computationally intensive, repetitive, and often exceed the capabilities of the CPU, leaving little time for higher level tasks. ...
194
click to vote
SASP
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...