706 search results - page 26 / 142 » Super Solutions in Constraint Programming |
115
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
CP
2007
Springer
15 years 6 months ago
2007
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
109
click to vote
AGP
1995
IEEE
15 years 3 months ago
1995
IEEE
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
139
click to vote
SAS
1992
Springer
15 years 3 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...