Sciweavers

Share
10 search results - page 1 / 2
» Balancing Bounded Treewidth Circuits
Sort
View
CSR
2010
Springer
9 years 4 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
AAAI
2006
9 years 21 days ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
9 years 5 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
ASPDAC
1999
ACM
144views Hardware» more  ASPDAC 1999»
9 years 3 months ago
Model Order Reduction of Large Circuits Using Balanced Truncation
A method is introduced for model order reduction of large circuits extracted from layout. The algorithm, which is based on balanced realization, can be used for reducing the order ...
Payam Rabiei, Massoud Pedram
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
9 years 4 months ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...
books