91 search results - page 17 / 19 » A Simple Semantics for Polymorphic Recursion |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Persons may perform an activity in many different styles, or noise may cause an identical activity to have different temporal structures. We present a robust methodology for recog...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
TGC
2005
Springer
14 years 1 months ago
2005
Springer
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
This paper tackles shape grammar parsing for facade segmentation using a novel optimization approach based on reinforcement learning (RL). To this end, we use a binary recursive g...