Sciweavers

5580 search results - page 1015 / 1116
» Randomized priority algorithms
Sort
View
JMLR
2012
11 years 10 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
JMLR
2012
11 years 10 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
JMLR
2012
11 years 10 months ago
Marginal Regression For Multitask Learning
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
Mladen Kolar, Han Liu
TOG
2012
582views Communications» more  TOG 2012»
11 years 10 months ago
Synthesis of detailed hand manipulations using contact sampling
Capturing human activities that involve both gross full-body motion and detailed hand manipulation of objects is challenging for standard motion capture systems. We introduce a ne...
Yuting Ye, C. Karen Liu
CVPR
2012
IEEE
11 years 10 months ago
Synthesizing oil painting surface geometry from a single photograph
We present an approach to synthesize the subtle 3D relief and texture of oil painting brush strokes from a single photograph. This task is unique from traditional synthesize algor...
Wei Luo, Zheng Lu, Xiaogang Wang, Ying-Qing Xu, Mo...
« Prev « First page 1015 / 1116 Last » Next »