2612 search results - page 90 / 523 » Switching Graphs and Their Complexity |
COLT
2006
Springer
14 years 1 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
DM
2006
13 years 10 months ago
2006
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
LCC
1994
14 years 2 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
DSD
2003
IEEE
14 years 3 months ago
2003
IEEE
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
AAMAS
2005
Springer
14 years 3 months ago
2005
Springer
This paper presents a model for adaptive agents. The model describes the behavior of an agent as a graph of roles, in short a behavior graph. Links between roles provide conditions...