Sciweavers

3059 search results - page 428 / 612
» with Wide Functional Units
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
14 years 3 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
SACMAT
2005
ACM
14 years 3 months ago
Composing and combining policies under the policy machine
As a major component of any host, or network operating system, access control mechanisms come in a wide variety of forms, each with their individual attributes, functions, methods...
David F. Ferraiolo, Serban I. Gavrila, Vincent C. ...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 3 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
NSPW
2004
ACM
14 years 3 months ago
Property-based attestation for computing platforms: caring about properties, not mechanisms
Over the past years, the computing industry has started various initiatives announced to increase computer security by means of new hardware architectures. The most notable effort...
Ahmad-Reza Sadeghi, Christian Stüble