Sciweavers

143 search results - page 16 / 29
» Data-Flow Analysis of Program Fragments
Sort
View
BMCBI
2008
173views more  BMCBI 2008»
13 years 9 months ago
Improved machine learning method for analysis of gas phase chemistry of peptides
Background: Accurate peptide identification is important to high-throughput proteomics analyses that use mass spectrometry. Search programs compare fragmentation spectra (MS/MS) o...
Allison Gehrke, Shaojun Sun, Lukasz A. Kurgan, Nat...
FPGA
2004
ACM
119views FPGA» more  FPGA 2004»
14 years 3 months ago
A quantitative analysis of the speedup factors of FPGAs over processors
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported. This paper presents an analysis, both quantitative a...
Zhi Guo, Walid A. Najjar, Frank Vahid, Kees A. Vis...
PEPM
1994
ACM
14 years 1 months ago
The Essence of Eta-Expansion in Partial Evaluation
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...
HPDC
2008
IEEE
13 years 9 months ago
Code coverage, performance approximation and automatic recognition of idioms in scientific applications
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
Jiahua He, Allan Snavely, Rob F. Van der Wijngaart...
JUCS
2006
92views more  JUCS 2006»
13 years 9 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa