Sciweavers

1180 search results - page 62 / 236
» An Instance Selection Approach to Multiple Instance Learning
Sort
View
ICIP
2005
IEEE
14 years 10 months ago
A complementary SVMs-based image annotation system
A novel automatic image annotation system is proposed, which integrates two sets of SVMs (Support Vector Machines), namely the MIL-based (Multiple Instance Learning) and global-fe...
Yutao Han, Xiaojun Qi
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 3 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
COLT
2005
Springer
14 years 2 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
ICDM
2009
IEEE
199views Data Mining» more  ICDM 2009»
14 years 3 months ago
Active Learning with Adaptive Heterogeneous Ensembles
—One common approach to active learning is to iteratively train a single classifier by choosing data points based on its uncertainty, but it is nontrivial to design uncertainty ...
Zhenyu Lu, Xindong Wu, Josh Bongard
SAT
2009
Springer
132views Hardware» more  SAT 2009»
14 years 3 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman