245 search results - page 46 / 49 » A Fast Fourier Transform Compiler |
AGTIVE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
CASES
2003
ACM
14 years 19 days ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
PDPTA
2000
13 years 8 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
BMCBI
2006
13 years 7 months ago
2006
Background: Statistical comparison of peptide profiles in biomarker discovery requires fast, userfriendly software for high throughput data analysis. Important features are flexib...
BMCBI
2007
13 years 7 months ago
2007
Background: Many algorithms have been developed for deciphering the tandem mass spectrometry (MS) data sets. They can be essentially clustered into two classes. The first performs...