Sciweavers

1294 search results - page 107 / 259
» FFT Compiler Techniques
Sort
View
CAL
2006
13 years 9 months ago
From sequential programs to concurrent threads
Chip multiprocessors are of increasing importance due to recent difficulties in achieving higher clock frequencies in uniprocessors, but their success depends on finding useful wor...
Guilherme Ottoni, Ram Rangan, Adam Stoler, Matthew...
IJPRAI
2000
108views more  IJPRAI 2000»
13 years 8 months ago
Knowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since...
Helmut Prendinger, Mitsuru Ishizuka, Gerhard Schur...
JOLLI
2010
107views more  JOLLI 2010»
13 years 7 months ago
PGF: A Portable Run-time Format for Type-theoretical Grammars
Abstract PGF (Portable Grammar Format) is a low-level language used as a target of compiling grammars written in GF (Grammatical Framework). Low-level and simple, PGF is easy to re...
Krasimir Angelov, Björn Bringert, Aarne Ranta
TOG
2012
230views Communications» more  TOG 2012»
11 years 11 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
ICS
2009
Tsinghua U.
14 years 3 months ago
Parametric multi-level tiling of imperfectly nested loops
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multilevel tiled code is essential for maximizing da...
Albert Hartono, Muthu Manikandan Baskaran, C&eacut...