1450 search results - page 43 / 290 » On the Complexity of Hardness Amplification |
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
SIAMCOMP
2010
13 years 6 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...