416 search results - page 50 / 84 » A Paradigm for Parallel Matrix Algorithms: |
157
click to vote
CASES
2001
ACM
15 years 7 months ago
2001
ACM
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
245
click to vote
SASP
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
130
click to vote
ICPPW
2002
IEEE
15 years 9 months ago
2002
IEEE
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
175
click to vote
EEF
2000
15 years 7 months ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
144
click to vote
PDPTA
2003
15 years 5 months ago
2003
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...