Sciweavers

1525 search results - page 7 / 305
» Matching with Regular Constraints
Sort
View
ICPR
2008
IEEE
14 years 1 months ago
Non-rigid image registration based on the globally optimized correspondences
In this paper, we propose a new approach to the non-rigid image registration. This problem can be easily attacked if we can find regularly distributed correspondence points over ...
Hyung il Koo, Jung Gap Kuk, Nam Ik Cho
LATIN
2000
Springer
13 years 11 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito
CP
2009
Springer
14 years 8 months ago
SOGgy Constraints: Soft Open Global Constraints
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
Michael J. Maher
ICALP
2004
Springer
14 years 22 days ago
Greedy Regular Expression Matching
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
Alain Frisch, Luca Cardelli
CPAIOR
2007
Springer
14 years 1 months ago
Modeling the Regular Constraint with Integer Programming
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Marie-Claude Côté, Bernard Gendron, L...