Sciweavers

778 search results - page 104 / 156
» Efficient Code Generation for Automatic Parallelization and ...
Sort
View
PLDI
1996
ACM
15 years 1 months ago
Realistic Compilation by Partial Evaluation
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
Michael Sperber, Peter Thiemann
CASES
2007
ACM
14 years 11 months ago
Facilitating compiler optimizations through the dynamic mapping of alternate register structures
Aggressive compiler optimizations such as software pipelining and loop invariant code motion can significantly improve application performance, but these transformations often re...
Chris Zimmer, Stephen Roderick Hines, Prasad Kulka...
PLILP
1994
Springer
15 years 1 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
ICDCS
2009
IEEE
14 years 7 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang