Sciweavers

568 search results - page 31 / 114
» New bounds for the Cebysev functional
Sort
View
CDC
2008
IEEE
228views Control Systems» more  CDC 2008»
14 years 2 months ago
Stability analysis for neural networks with time-varying delay
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
Xun-Lin Zhu, Guang-Hong Yang
IRMA
2000
13 years 9 months ago
Recognizing bounds of context change in on-line learning
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
13 years 9 months ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek
GD
2007
Springer
14 years 1 months ago
Algorithms for Multi-criteria One-Sided Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
Marc Benkert, Herman J. Haverkort, Moritz Kroll, M...
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