3250 search results - page 71 / 650 » Parameterized Learning Complexity |
BIBE
2009
IEEE
14 years 1 months ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
PRIS
2004
13 years 11 months ago
2004
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
KI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. There is a growing research interest in the design of competitive and adaptive Game AI for complex computer strategy games. In this paper, we present a novel approach for...
ICANN
2005
Springer
14 years 3 months ago
2005
Springer
Humans can recognize biological motion from strongly impoverished stimuli, like point-light displays. Although the neural mechanism underlying this robust perceptual process have n...