1294 search results - page 36 / 259 » FFT Compiler Techniques |
140
Voted
PLILP
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
138
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Effective utilization of cache memories is a key factor in achieving high performance in computing the Discrete Fourier Transform (DFT). Most optimizationtechniques for computing ...
127
Voted
KI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[D...
134
Voted
ISQED
2006
IEEE
15 years 9 months ago
2006
IEEE
Due to aggressive technology scaling, VLSI circuits are becoming increasingly susceptible to transient errors caused by single-event-upsets (SEUs). In this paper, we introduce two...
112
Voted
SIGCSE
1997
ACM
15 years 7 months ago
1997
ACM
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...