Sciweavers

1822 search results - page 179 / 365
» Risk-Sensitive Online Learning
Sort
View
ETVC
2008
13 years 10 months ago
Intrinsic Geometries in Learning
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
Richard Nock, Frank Nielsen
CVPR
2011
IEEE
12 years 12 months ago
A Non-convex Relaxation Approach to Sparse Dictionary Learning
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
Jianping Shi, Xiang Ren, Jingdong Wang, Guang Dai,...
ESWS
2008
Springer
13 years 10 months ago
OntoGame: Weaving the Semantic Web by Online Games
Most of the challenges faced when building the Semantic Web require a substantial amount of human labor and intelligence. Despite significant advancement in ontology learning and h...
Katharina Siorpaes, Martin Hepp

Publication
353views
13 years 8 months ago
Online Multi-Person Tracking-by-Detection from a Single, Uncalibrated Camera
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...
Michael D. Breitenstein, Fabian Reichlin, Bastian ...
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
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...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...