Sciweavers

4255 search results - page 66 / 851
» On Learning Boolean Functions
Sort
View
FSE
2000
Springer
128views Cryptology» more  FSE 2000»
15 years 3 months ago
Ciphertext Only Reconstruction of Stream Ciphers Based on Combination Generators
This paper presents an operational reconstruction technique of most stream ciphers. We primarily expose it for key-stream generators which consist of several linear feedback shift ...
Anne Canteaut, Eric Filiol
ICML
2010
IEEE
15 years 28 days ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
ICCD
2008
IEEE
139views Hardware» more  ICCD 2008»
15 years 8 months ago
Probabilistic error propagation in logic circuits using the Boolean difference calculus
- A gate level probabilistic error propagation model is presented which takes as input the Boolean function of the gate, the signal and error probabilities of the gate inputs, and ...
Nasir Mohyuddin, Ehsan Pakbaznia, Massoud Pedram
DATE
2005
IEEE
176views Hardware» more  DATE 2005»
15 years 5 months ago
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), ...
Vasco M. Manquinho, João P. Marques Silva
DSD
2004
IEEE
126views Hardware» more  DSD 2004»
15 years 3 months ago
Boolean Minimizer FC-Min: Coverage Finding Process
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
Petr Fiser, Hana Kubatova