177 search results - page 17 / 36 » Minimal Data Dependence Abstractions for Loop Transformation... |
CC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We introduce the concept of future values. Using future values it is possible to represent programs in a new control-flow form such that on any control flow path the data...
89
Voted
CC
2006
Springer
15 years 1 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
TCSV
2002
14 years 9 months ago
2002
A novel frequency-domain technique for image blocking artifact detection and reduction is presented in this paper. The algorithm first detects the regions of the image which presen...
CN
2002
14 years 9 months ago
2002
Abstract--We study in this paper a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poi...
ISHPC
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...