Sciweavers

1795 search results - page 152 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
CAV
2008
Springer
115views Hardware» more  CAV 2008»
13 years 11 months ago
An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexi...
Oliver Wienand, Markus Wedler, Dominik Stoffel, Wo...
INTEGRATION
2008
89views more  INTEGRATION 2008»
13 years 9 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
JUCS
2000
135views more  JUCS 2000»
13 years 8 months ago
The Price of Routing in FPGAs
: Studying the architectural evolution of mainstream field programmable gate arrays (FPGAs) leads to the following remark: in these circuits, the proportion of silicon devoted to r...
Florent de Dinechin
IWSEC
2010
Springer
13 years 6 months ago
Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption
This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party prot...
Takuho Mitsunaga, Yoshifumi Manabe, Tatsuaki Okamo...
ICPR
2006
IEEE
14 years 10 months ago
Semantic Understanding of Continued and Recursive Human Activities
This paper presents a methodology for semantic understanding of complex and continued human activities. A context-free grammar (CFG) based representation scheme developed earlier ...
J. K. Aggarwal, Michael S. Ryoo