738 search results - page 97 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
177
click to vote
PVLDB
2011
14 years 4 months ago
2011
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
DAC
2002
ACM
15 years 10 months ago
2002
ACM
This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algor...
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
To satisfy high-performance computing demand in modern embedded devices, current embedded processor architectures provide designer with possibility either to define customized ins...