Sciweavers

113 search results - page 20 / 23
» Asymptotic Nonlinearity of Boolean Functions
Sort
View
SIAMCO
2010
115views more  SIAMCO 2010»
13 years 1 months ago
Identification of Hammerstein Systems with Quantized Observations
This work is concerned with identification of Hammerstein systems whose outputs are measured by quantized sensors. The system consists of a memoryless nonlinearity that is polynomi...
Yanlong Zhao, Ji-Feng Zhang, Le Yi Wang, Gang Geor...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 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
VLSISP
2002
114views more  VLSISP 2002»
13 years 6 months ago
Image processing using cellular neural networks based on multi-valued and universal binary neurons
Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an a...
Igor N. Aizenberg, Constantine Butakoff
MSWIM
2004
ACM
14 years 10 days ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
FOCS
1999
IEEE
13 years 11 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio