925 search results - page 82 / 185 » Connectivity on Complete Lattices |
126
click to vote
ESANN
2004
15 years 7 months ago
2004
We derive analytical expressions of local codim-1-bifurcations for a fully connected, additive, discrete-time RNN, where we regard the external inputs as bifurcation parameters. Th...
138
click to vote
APAL
2008
15 years 6 months ago
2008
This paper continues [Sh500] and [DzSh692]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the con...
175
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
133
click to vote
ORDER
2010
15 years 4 months ago
2010
This paper investigates quantum logic from the perspective of categorical logic, and starts from minimal assumptions, namely the existence of involutions/daggers and kernels. The ...
177
click to vote
IJRR
2010
15 years 3 months ago
2010
This paper presents the minimum-time sequences of rotations and translations that connect two configurations of a rigid body in the plane. The configuration of the body is its pos...