1688 search results - page 22 / 338 » The Complexity of Rationalizing Matchings |
ICPR
2000
IEEE
14 years 2 days ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
ALGORITHMICA
2010
13 years 7 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
ICAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Service-oriented architectures enable services to be dynamically selected and integrated at runtime, thus enabling system flexibility and adaptiveness—autonomic attributes that...
COMPGEOM
1989
ACM
13 years 11 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
DAM
1999
13 years 7 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...