317 search results - page 10 / 64 » Factoring logic functions using graph partitioning |
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
COMPUTING
2006
13 years 7 months ago
2006
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
CAV
1998
Springer
13 years 12 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
GLVLSI
1996
IEEE
13 years 12 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...