Sciweavers

35 search results - page 4 / 7
» Online Multiple Instance Learning with No Regret
Sort
View
ECCV
2010
Springer
13 years 7 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
ISVC
2010
Springer
13 years 6 months ago
Attention-Based Target Localization Using Multiple Instance Learning
Abstract. We propose a novel Multiple Instance Learning (MIL) framework to perform target localization from image sequences. The proposed approach consists of a softmax logistic re...
Karthik Sankaranarayanan, James W. Davis
CVPR
2009
IEEE
15 years 2 months ago
A Min-Max Framework of Cascaded Classifier with Multiple Instance Learning for Computer Aided Diagnosis
The computer aided diagnosis (CAD) problems of detecting potentially diseased structures from medical images are typically distinguished by the following challenging characterist...
Dijia Wu (Rensselaer Polytechnic Institute), Jinbo...
PODC
2009
ACM
14 years 8 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
CORR
2011
Springer
178views Education» more  CORR 2011»
12 years 11 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari