210 search results - page 26 / 42 » Universal Booleanization of Constraint Models |
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
ACNS
2005
Springer
14 years 3 months ago
2005
Springer
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...
DATE
2008
IEEE
14 years 4 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
QSIC
2005
IEEE
14 years 3 months ago
2005
IEEE
Database application programs typically contain program units that use SQL statements to manipulate records in database instances. Testing the correctness of data manipulation by ...
DAC
2006
ACM
14 years 10 months ago
2006
ACM
Highly regular, nanodevice based architectures have been proposed to replace pure CMOS based architectures in the emerging post CMOS era. Since bottom-up self-assembly is used to ...