Sciweavers

373 search results - page 43 / 75
» Learning Arithmetic Circuits
Sort
View
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
13 years 11 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
JSAT
2006
108views more  JSAT 2006»
13 years 7 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
UC
2010
Springer
13 years 5 months ago
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via p...
Genaro Juárez Martínez, Kenichi Mori...
CASES
2010
ACM
13 years 4 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...