427 search results - page 23 / 86 » A Graph Based Synthesis Algorithm for Solving CSPs |
ICCAD
1997
IEEE
13 years 12 months ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
ETFA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. In this paper, reverse partially-marked safe net condition/event systems (RsNCES) are introduced, rules of their functioning are defined and convenient interpretation met...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...