46 search results - page 9 / 10 » Efficient Parallel Mappings of a Dynamic Programming Algorit... |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
The graphics processing unit (GPU) has evolved from a fixedfunction processor with programmable stages to a programmable processor with many fixed-function components that deliver...
BIBE
2008
IEEE
14 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We present an efficient multi stage approach to detection of deformable objects in real, cluttered images given a single or few hand drawn examples as models. The method handles de...
MIDDLEWARE
2004
Springer
14 years 25 days ago
2004
Springer
: The next generation of scientific experiments and studies, popularly called as e-Science, is carried out by large collaborations of researchers distributed around the world engag...
BMCBI
2011
12 years 11 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...