Sciweavers

1795 search results - page 141 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
SP
2010
IEEE
178views Security Privacy» more  SP 2010»
14 years 25 days ago
Overcoming an Untrusted Computing Base: Detecting and Removing Malicious Hardware Automatically
The computer systems security arms race between attackers and defenders has largely taken place in the domain of software systems, but as hardware complexity and design processes ...
Matthew Hicks, Murph Finnicum, Samuel T. King, Mil...
AEI
1998
98views more  AEI 1998»
13 years 8 months ago
Function-directed electrical design analysis
Functional labels provide a simple but very reusable way for defining the functionality of a system and for making use of that knowledge. Unlike more complex functional representa...
Chris J. Price
GLVLSI
2009
IEEE
262views VLSI» more  GLVLSI 2009»
13 years 6 months ago
Power distribution paths in 3-D ICS
Distributing power and ground to a vertically integrated system is a complex and difficult task. Interplane communication and power delivery are achieved by through silicon vias (...
Vasilis F. Pavlidis, Giovanni De Micheli
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
13 years 3 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
DAC
2002
ACM
14 years 10 months ago
ILP-based engineering change
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...
Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng...