1294 search results - page 49 / 259 » FFT Compiler Techniques |
CC
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally conside...
TIC
2000
Springer
14 years 7 days ago
2000
Springer
Abstract. A type-based certifying compiler maps source code to machine code and target-level type annotations. The target-level annotations make it possible to prove easily that th...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
Dynamic languages typically allow programs to be written y high level of abstraction. But their dynamic nature makes it very hard to compile such languages, meaning that a price h...
FCCM
2000
IEEE
14 years 1 months ago
2000
IEEE
Mapping computations written in high-level programming languages to FPGA-based computing engines requires programmers to generate the datapath responsible for the core of the comp...
WIA
1999
Springer
1999
Springer
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
14 years 28 days ago
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...