Sciweavers

126 search results - page 10 / 26
» Interpreted Nets
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
FECS
2008
148views Education» more  FECS 2008»
13 years 8 months ago
Net4Voice - New Technologies for voice-converting in barrier-free learning environment
- Net4Voice project consists in testing voice recognition techniques and methods within learning contexts. The need to support learning process with non traditional technologies de...
Raffaella Primiani, Daniela Tibaldi, Luca Garlasch...
GRAMMARS
2000
97views more  GRAMMARS 2000»
13 years 7 months ago
Proof-Nets, Hybrid Logics and Minimalist Representations
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...
Alain Lecomte
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
14 years 27 days ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham
CSR
2008
Springer
13 years 9 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann