3625 search results - page 97 / 725 » On choosing |
144
click to vote
IM
2007
15 years 6 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
133
click to vote
AAECC
2000
Springer
15 years 6 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
158
click to vote
COLING
2002
15 years 6 months ago
2002
We present in this paper a technique allowing to choose the parsing granularity within the same approach relying on a constraint-based formalism. Its main advantage lies in the fa...
150
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Game theoretic models of learning which are based on the strategic form of the game cannot explain learning in games with large extensive form. We study learning in such games by ...
135
click to vote
DEDS
2002
15 years 6 months ago
2002
Abstract. We consider a generalized form of the conventional decentralized control architecture for discreteevent systems where the control actions of a set of supervisors can be `...