Sciweavers

92 search results - page 12 / 19
» Nonlinearity Bounds and Constructions of Resilient Boolean F...
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 10 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
OPODIS
2004
13 years 8 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
WCC
2005
Springer
140views Cryptology» more  WCC 2005»
14 years 5 days ago
Constructions of Complementary Sequences for Power-Controlled OFDM Transmission
We present constructions of polyphase sequences suitable for the use as codewords in orthogonal frequency-division multiplexing (OFDM) with strictly bounded peak-to-mean envelope p...
Kai-Uwe Schmidt, Adolf Finger
ICISC
1998
110views Cryptology» more  ICISC 1998»
13 years 8 months ago
The nonhomomorphicity of S-boxes
Abstract. In this paper, we introduce the concept of kth-order nonhomomorphicity of mappings or S-boxes as an alternative indicator that forecasts nonlinearity characteristics of a...
Yuliang Zheng, Xian-Mo Zhang
ICALP
2005
Springer
14 years 7 days ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál