2609 search results - page 244 / 522 » Optimizing for parallelism and data locality |
208
click to vote
BIBE
2008
IEEE
16 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...
210
click to vote
ISBI
2004
IEEE
16 years 7 months ago
2004
IEEE
We describe the use of compact support radial basis functions (CSRBFs) for simulation of soft tissue deformation. CSRBFs allow surface and volumetric deformations to be computed i...
174
click to vote
JUCS
2008
15 years 6 months ago
2008
: Nowadays, while large-sized multimedia objects are becoming very popular throughout the Internet, one of the important issues appears to be the acceleration of content delivery n...
265
click to vote
TOG
2012
13 years 9 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
150
click to vote
GECCO
2004
Springer
16 years 11 hour ago
2004
Springer
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...