1525 search results - page 17 / 305 » Matching with Regular Constraints |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
SIAMJO
2008
13 years 7 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper deals with the problem of regularizing noisy fields of diffusion tensors, considered as symmetric and semi-positive definite ? ? ? matrices (as for instance 2D structur...
KDID
2003
13 years 8 months ago
2003
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...