Sciweavers

1859 search results - page 143 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
235
Voted
CVPR
2010
IEEE
16 years 2 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
ATAL
2008
Springer
15 years 8 months ago
Sequential decision making in repeated coalition formation under uncertainty
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...
Georgios Chalkiadakis, Craig Boutilier
COLT
2003
Springer
15 years 11 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
Mehryar Mohri
CVPR
2009
IEEE
17 years 1 months ago
Regularized Multi-Class Semi-Supervised Boosting
Many semi-supervised learning algorithms only deal with binary classification. Their extension to the multi-class problem is usually obtained by repeatedly solving a set of bina...
Amir Saffari, Christian Leistner, Horst Bischof
CVPR
2010
IEEE
16 years 2 months ago
PROST: Parallel Robust Online Simple Tracking
Tracking-by-detection is increasingly popular in order to tackle the visual tracking problem. Existing adaptive methods suffer from the drifting problem, since they rely on selfup...
Jakob Santner, Christian Leistner, Amir Saffari, T...