3250 search results - page 286 / 650 » Parameterized Learning Complexity |
128
Voted
NN
1998
Springer
15 years 4 months ago
1998
Springer
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
142
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
144
click to vote
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
317
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
Complex human activities occurring in videos can be defined in terms of temporal configurations of primitive actions. Prior work typically hand-picks the primitives, their total...
164
click to vote
JMLR
2012
13 years 7 months ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...