Sciweavers

3557 search results - page 79 / 712
» Authoring Presentation for OpenMath
Sort
View
IJON
1998
140views more  IJON 1998»
15 years 5 months ago
Comment on "Discrete-time recurrent neural network architectures: A unifying review"
Paper [1] aimed at providing a unified presentation of neural network architectures. We show in the present comment (i) that the canonical form of recurrent neural networks presen...
Léon Personnaz, Gérard Dreyfus
COMCOM
1999
107views more  COMCOM 1999»
15 years 5 months ago
A formalisation and evaluation of certificate policies
Certificate policies play a central role in public key infrastructures, since they are the basis for the evaluation of trust in binding between a key and a subject in a public key...
Tomaz Klobucar, Borka Jerman-Blazic
TSMC
2002
102views more  TSMC 2002»
15 years 5 months ago
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
M. Agache, B. John Oommen
IJOE
2008
122views more  IJOE 2008»
15 years 4 months ago
Mixed Reality Environment for Web-Based Laboratory Interactive Learning
: This paper presents a web-based laboratory for distance learners by incorporating simulation and hardware implementation into web-based e-learning systems. It presents a developm...
Kasim M. Al-Aubidy
TCS
2011
15 years 16 days ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann