Sciweavers

1294 search results - page 14 / 259
» FFT Compiler Techniques
Sort
View
AAAI
2008
13 years 11 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan
ICIP
2009
IEEE
14 years 9 months ago
Fast Pseudo-enhancement Correction In Ct Colonography Using Linear Shift-invariant Filters
This paper presents a novel method to approximate shiftvariant Gaussian filtering of an image using a set of shiftinvariant Gaussian filters. This approximation affords filtering ...
DAC
2009
ACM
13 years 12 months ago
GPU friendly fast Poisson solver for structured power grid network analysis
In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dim...
Jin Shi, Yici Cai, Wenting Hou, Liwei Ma, Sheldon ...
PLDI
1997
ACM
14 years 24 days ago
Two for the Price of One: Composing Partial Evaluation and Compilation
One of the flagship applications of partial evaluation is compilation and compiler generation. However, partial evaluation is usually expressed as a source-to-source transformati...
Michael Sperber, Peter Thiemann
ISLPED
1997
ACM
108views Hardware» more  ISLPED 1997»
14 years 24 days ago
Techniques for low energy software
The energy consumption of a system depends upon the hardware and software component of a system. Since it is the software which drives the hardware in most systems, decisions take...
Huzefa Mehta, Robert Michael Owens, Mary Jane Irwi...