2018 search results - page 123 / 404 » Code Normal Forms |
AAAI
2008
15 years 4 months ago
2008
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 ...
119
click to vote
LFP
1990
15 years 3 months ago
1990
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 ...
112
click to vote
EMNLP
2010
15 years 13 days ago
2010
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...
133
click to vote
TCS
2011
14 years 9 months ago
2011
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...
100
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
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...