3250 search results - page 96 / 650 » Parameterized Learning Complexity |
102
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
124
Voted
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, we investigate the detection of semantic
human actions in complex scenes. Unlike conventional
action recognition in well-controlled environments,
action detection...
96
Voted
KDD
1998
ACM
15 years 6 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
124
click to vote
GECCO
1999
Springer
15 years 6 months ago
1999
Springer
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
130
click to vote
SIGDIAL
2010
15 years 5 days ago
2010
Classifying the dialogue act of a user utterance is a key functionality of a dialogue management system. This paper presents a data-driven dialogue act classifier that is learned ...