Sciweavers

695 search results - page 23 / 139
» Efficient Algorithms for General Active Learning
Sort
View
IJCV
2006
299views more  IJCV 2006»
13 years 8 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
UAI
2001
13 years 10 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger
ICML
2007
IEEE
14 years 9 months ago
More efficiency in multiple kernel learning
An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by Sonnenburg et al. (2006). This approach has opened new perspectives since it makes ...
Alain Rakotomamonjy, Francis Bach, Stéphane...
ICML
2010
IEEE
13 years 10 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
ICML
2010
IEEE
13 years 10 months ago
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
Daniel J. Lizotte, Michael H. Bowling, Susan A. Mu...