317 search results - page 50 / 64 » Factoring logic functions using graph partitioning |
159
Voted
IEEEPACT
2008
IEEE
15 years 10 months ago
2008
IEEE
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
105
Voted
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
: - The rising complexity of modern embedded systems is causing a significant increase in the verification effort required by hardware designers and software developers, leading to...
118
click to vote
TCC
2005
Springer
15 years 9 months ago
2005
Springer
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
134
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
132
Voted
EMNLP
2010
15 years 1 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...