Sciweavers

199 search results - page 6 / 40
» Implementing Circularity Using Partial Evaluation
Sort
View
PLDI
1996
ACM
13 years 11 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
ISSAC
1995
Springer
155views Mathematics» more  ISSAC 1995»
13 years 11 months ago
On the Implementation of Dynamic Evaluation
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
Peter A. Broadbery, T. Gómez-Díaz, S...
HPCA
2012
IEEE
12 years 2 months ago
Flexible register management using reference counting
Conventional out-of-order processors that use a unified physical register file allocate and reclaim registers explicitly using a free list that operates as a circular queue. We ...
Steven Battle, Andrew D. Hilton, Mark Hempstead, A...
CBMS
2004
IEEE
13 years 11 months ago
Partial Shape Matching of Spine X-Ray Shapes Using Dynamic Programming
The osteophyte shows only on some particular locations on the vertebra. This indicates that other locations on the vertebra shape contain that are not of interest hinder the spine...
Xiaoqian Xu, D. J. Lee, Sameer Antani, L. Rodney L...
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
14 years 8 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch