292 search results - page 10 / 59 » Are Stable Instances Easy |
91
Voted
MP
2006
15 years 19 days ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
111
Voted
HIPC
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
99
Voted
ALGORITHMICA
2010
15 years 25 days ago
2010
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
130
Voted
LPNMR
1997
Springer
15 years 4 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
113
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Multiple Instance Learning (MIL) provides a framework for training a discriminative classifier from data with ambiguous labels. This framework is well suited for the task of learni...