848 search results - page 21 / 170 » Randomness and the linear degrees of computability |
MOC
2000
14 years 11 months ago
2000
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...
ICANN
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Reservoir Computing (RC) uses a randomly created recurrent neural network where only a linear readout layer is trained. In this work, RC is used for detecting complex eve...
107
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...
168
Voted
SJ
2011
14 years 6 months ago
2011
—In this paper, we study the resilience of supply networks against disruptions and provide insights to supply chain managers on how to construct a resilient supply network from t...