Sciweavers

6142 search results - page 125 / 1229
» The Complexity of Partition Functions
Sort
View
ICCD
2002
IEEE
101views Hardware» more  ICCD 2002»
15 years 6 months ago
Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
EUROPAR
2003
Springer
15 years 3 months ago
On the Characterization of Distributed Virtual Environment Systems
Abstract. Distributed Virtual Environment systems have experienced a spectacular growth last years. One of the key issues in the design of scalable and costeffective DVE systems is...
Pedro Morillo, Juan M. Orduña, Marcos Fern&...
ICCAD
1994
IEEE
119views Hardware» more  ICCAD 1994»
15 years 1 months ago
Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays
We present a new min-cut based placement algorithm for large scale sea-of-gates arrays. In the past all such algorithms used a xed cut line sequence that is determined before min...
Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai...
TSP
2010
14 years 4 months ago
Rate distortion bounds on passive sonar performance
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
Tianzhu Meng, John R. Buck
WEWORC
2007
148views Cryptology» more  WEWORC 2007»
14 years 11 months ago
Preimages for Reduced-Round Tiger
The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on finding collisions. In this paper we describe a preimage attack on the compression function ...
Sebastiaan Indesteege, Bart Preneel