3250 search results - page 452 / 650 » Parameterized Learning Complexity |
122
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
127
click to vote
ROBOCUP
1998
Springer
15 years 8 months ago
1998
Springer
The RoboCup simulator competition is one of the most challenging international proving grounds for contemporary AI research. Exactly because of the high level of complexity and a l...
155
click to vote
ROBOCUP
1998
Springer
15 years 8 months ago
1998
Springer
Co-evolution has been receiving increased attention as a method for multi agent simultaneous learning. This paper discusses how multiple robots can emerge cooperative behaviors thr...
154
click to vote
ECML
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
154
click to vote
AVSS
2006
IEEE
15 years 7 months ago
2006
IEEE
The success of any Bayesian particle filtering based tracker relies heavily on the ability of the likelihood function to discriminate between the state that fits the image well an...