Sciweavers

3122 search results - page 86 / 625
» A Theory of Network Equivalence
Sort
View
ENTCS
2002
108views more  ENTCS 2002»
15 years 6 months ago
Bisimulation Relations for Dynamical and Control Systems
In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notio...
Esfandiar Haghverdi, Paulo Tabuada, George J. Papp...
POPL
2006
ACM
16 years 6 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
COLT
1994
Springer
15 years 10 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
ECML
1993
Springer
15 years 10 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
ACL
1994
15 years 7 months ago
Dual-Coding Theory and Connectionist Lexical Selection
We introduce the bilingual dual-coding theory as a model for bilingual mental representation. Based on this model, lexical selection neural networks are implemented for a connecti...
Ye-Yi Wang