692 search results - page 12 / 139 » BDD minimization for approximate computing |
123
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
112
Voted
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
133
Voted
SPIN
2004
Springer
15 years 9 months ago
2004
Springer
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
135
Voted
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
118
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
In this work we revisit the Mumford-Shah functional, one
of the most studied variational approaches to image segmentation.
The contribution of this paper is to propose an
algori...