119 search results - page 9 / 24 » A relaxed approach to combinatorial problems in robustness a... |
ACML
2009
Springer
14 years 24 days ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
SSIAI
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper we propose a new probabilistic relaxation framework to perform robust multiple motion estimation and segmentation from a sequence of images. Our approach uses displa...
AIPS
2007
13 years 11 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
ICTAI
1999
IEEE
14 years 1 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...