292 search results - page 2 / 59 » Are Stable Instances Easy |
DAM
2007
13 years 10 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
SIAMDM
2011
13 years 5 months ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
ALGORITHMICA
2010
13 years 11 months ago
2010
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
AAAI
2006
14 years 7 days ago
2006
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
CVPR
2011
IEEE
13 years 7 months ago
2011
IEEE
Objects vary in their visual complexity, yet existing discovery methods perform “batch” clustering, paying equal attention to all instances simultaneously—regardless of the ...