601 search results - page 24 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
CDB
2004
Springer
15 years 2 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
IJCAI
1993
14 years 10 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...