608 search results - page 6 / 122 » Random Systems with Complete Connections |
CORR
2010
Springer
13 years 9 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...
IJON
2007
13 years 9 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
WWW
2001
ACM
14 years 10 months ago
2001
ACM
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be reg...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
IANDC
2010
13 years 8 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...