1294 search results - page 90 / 259 » FFT Compiler Techniques |
127
click to vote
COCO
2007
Springer
15 years 7 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
136
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
217
click to vote
ENTCS
2007
15 years 3 months ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
119
Voted
SC
1995
ACM
15 years 7 months ago
1995
ACM
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
94
Voted
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...