Sciweavers

8699 search results - page 153 / 1740
» Elements of the Theory of Computation
Sort
View
DAC
1996
ACM
15 years 3 months ago
Delay Minimal Decomposition of Multiplexers in Technology Mapping
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
Shashidhar Thakur, D. F. Wong, Shankar Krishnamoor...
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 5 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
ESANN
2008
15 years 1 months ago
Computational model for amygdala neural networks
We present a computational model of amygdala neural networks. It is used to simulate neuronal activation in amygdala nuclei at different stages of aversive conditioning experiments...
Jean Marc Salotti
CIE
2007
Springer
15 years 5 months ago
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Andrej Bauer, Christopher A. Stone
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
14 years 10 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers