4117 search results - page 294 / 824 » On the Satisfiability of Complex Constraints |
167
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
187
click to vote
DLOG
2004
15 years 8 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
179
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
170
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
This paper introduces an extension of Hartley's selfcalibration technique [8] based on properties of the essential matrix, allowing for the stable computation of varying foca...
200
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...