664 search results - page 72 / 133 » Some results for a class of generalized polynomials |
65
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
104
click to vote
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
119
click to vote
LION
2009
Springer
15 years 4 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...