Sciweavers

180 search results - page 11 / 36
» Program transformation for numerical precision
Sort
View
122
Voted
ICALP
2010
Springer
15 years 8 months ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
127
Voted
ICS
2009
Tsinghua U.
15 years 10 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...
118
Voted
ICALP
2000
Springer
15 years 7 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
111
Voted
SIAMIS
2008
116views more  SIAMIS 2008»
15 years 3 months ago
Quantitative Object Reconstruction Using Abel Transform X-Ray Tomography and Mixed Variable Optimization
This paper introduces a new approach to the problem of quantitative reconstruction of an object from few radiographic views. A mixed variable programming problem is formulated in ...
Mark A. Abramson, Thomas J. Asaki, J. E. Dennis, K...
147
Voted
LCPC
2005
Springer
15 years 9 months ago
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
Amir Kamil, Katherine A. Yelick