1882 search results - page 292 / 377 » Transformational Programming and Forests |
146
Voted
FPGA
1995
ACM
15 years 8 months ago
1995
ACM
A novel approach is presented for transforming a given scheduled and bound signal processing algorithm for a multiplexer based datapath to a BUS/RAM based FPGA datapath. A datapat...
134
click to vote
SAS
1997
Springer
15 years 8 months ago
1997
Springer
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
156
click to vote
FLOPS
2008
Springer
15 years 6 months ago
2008
Springer
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose ...
139
Voted
DAGSTUHL
2007
15 years 6 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
148
click to vote
CATA
2003
15 years 6 months ago
2003
Many current general purpose processors use extensions to the instruction set architecture to enhance the performance of digital image processing and multimedia applications. In t...