Sciweavers

1449 search results - page 183 / 290
» Finiteness results for sigmoidal
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
SIAMNUM
2010
95views more  SIAMNUM 2010»
15 years 1 months ago
Robust BDDC Preconditioners for Reissner-Mindlin Plate Bending Problems and MITC Elements
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
L. Beirão da Veiga, C. Chinosi, Carlo Lovad...
FPL
1999
Springer
147views Hardware» more  FPL 1999»
15 years 10 months ago
Synthia: Synthesis of Interacting Automata Targeting LUT-based FPGAs
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
15 years 6 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger