1834 search results - page 168 / 367 » Online Learning in Monkeys |
304
click to vote
Publication
In this paper, we address the problem of automatically detecting and tracking a variable number of persons in complex
scenes using a monocular, potentially moving, uncalibrated ca...
167
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
188
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
150
click to vote
ICWL
2007
Springer
16 years 20 days ago
2007
Springer
In this paper we present the European project Open Dance and in particular our contribution to the 3D simulation of folk dances and their presentation on the web. Our aim is to pro...
158
click to vote
CIDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...