515 search results - page 84 / 103 » A Dynamic Programming Approach to Optimal Integrated Code Ge... |
167
click to vote
BIBE
2008
IEEE
15 years 11 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...
139
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
147
click to vote
CODES
2008
IEEE
15 years 11 months ago
2008
IEEE
Processor Idle Cycle Aggregation (PICA) is a promising approach for low power execution of processors, in which small memory stalls are aggregated to create a large one, and the p...
129
click to vote
DFT
2003
IEEE
15 years 9 months ago
2003
IEEE
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
147
click to vote
HICSS
1995
IEEE
15 years 8 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...