9842 search results - page 394 / 1969 » The Complexity of the Matching-Cut Problem |
117
click to vote
CAINE
2008
15 years 5 months ago
2008
This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological frag...
108
click to vote
VMV
2008
15 years 5 months ago
2008
Recently it was observed, that a combined formulation of tracking and reconstruction increases the robustness and accuracy of both these steps in structure-from-motion problems [9...
124
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
116
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
KBS
2007
15 years 4 months ago
2007
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...