3250 search results - page 216 / 650 » Parameterized Learning Complexity |
145
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
Boolean matching for multiple-output functions determines whether two given (in)completely-specified function vectors can be identical to each other under permutation and/or negat...
219
click to vote
KI
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
238
click to vote
AAAI
2011
14 years 6 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
145
click to vote
RSCTC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...