Sciweavers

373 search results - page 51 / 75
» Learning Arithmetic Circuits
Sort
View
CADE
2009
Springer
14 years 8 months ago
Real World Verification
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
André Platzer, Jan-David Quesel, Philipp R&...
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
14 years 8 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
14 years 1 months ago
Tool-support for the analysis of hybrid systems and models
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled u...
Andreas Bauer 0002, Markus Pister, Michael Tautsch...
VLSID
2007
IEEE
142views VLSI» more  VLSID 2007»
14 years 1 months ago
Novel Architectures for High-Speed and Low-Power 3-2, 4-2 and 5-2 Compressors
The 3-2, 4-2 and 5-2 compressors are the basic components in many applications, in particular partial product summation in multipliers. In this paper novel architectures and desig...
Sreehari Veeramachaneni, Kirthi M. Krishna, Lingam...
FOCS
2006
IEEE
14 years 1 months ago
Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
Yael Tauman Kalai, Ran Raz