738 search results - page 97 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
105
click to vote
CVPR
2007
IEEE
16 years 3 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...
101
click to vote
CORR
2006
Springer
15 years 1 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 ...
228
click to vote
PVLDB
2011
14 years 8 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
16 years 2 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...
102
click to vote
DATE
2008
IEEE
15 years 8 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...