Sciweavers

1795 search results - page 62 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 26 days ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
KES
2008
Springer
13 years 8 months ago
Instruction-based development: From evolution to generic structures of digital circuits
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
Michal Bidlo, Jaroslav Skarvada
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
14 years 2 months ago
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
Javier Esparza, Petr Jancar, Alexander Miller
HICSS
2003
IEEE
128views Biometrics» more  HICSS 2003»
14 years 2 months ago
Sensor Fusion and Complex Data Analysis for Predictive Maintenance
An essential step toward the development of an intelligent substation is to provide self-diagnosing capability at the equipment level. Transformers, circuit breakers and other sub...
Rahmat Shoureshi, Tim Norick, David Linder, John W...
ISCAS
2003
IEEE
90views Hardware» more  ISCAS 2003»
14 years 2 months ago
A reduction technique of large scale RCG interconnects in complex frequency domain
High frequency digital LSIs usually consist of many subcircuits coupled with multi-conductor interconnects embedded in the substrate. They sometimes cause serious problems of the ...
Yoshihiro Yamagami, Yoshifumi Nishio, Atsumi Hatto...