Sciweavers

2018 search results - page 123 / 404
» Code Normal Forms
Sort
View
AAAI
2008
15 years 8 months ago
Achieving Cooperation in a Minimally Constrained Environment
We describe a simple environment to study cooperation between two agents and a method of achieving cooperation in that environment. The environment consists of randomly generated ...
Steven Damer, Maria L. Gini
LFP
1990
171views more  LFP 1990»
15 years 7 months ago
Operational and Axiomatic Semantics of PCF
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
Brian T. Howard, John C. Mitchell
EMNLP
2010
15 years 4 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead
TCS
2011
15 years 1 months ago
A semantic measure of the execution time in linear logic
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
CVPR
2008
IEEE
16 years 8 months ago
High quality mesostructure acquisition using specularities
We propose a technique for cheap and efficient acquisition of mesostructure normal maps from specularities, which only requires a simple LCD monitor and a digital camera. Coded il...
Yannick Francken, Tom Cuypers, Tom Mertens, Jo Gie...