Sciweavers

1403 search results - page 29 / 281
» About Approximations of Exponentials
Sort
View
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 3 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
AMC
2004
105views more  AMC 2004»
14 years 11 months ago
Block matrix Sinc-Galerkin solution of the wind-driven current problem
A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an...
Sanoe Koonprasert, Kenneth L. Bowers
57
Voted
ADCM
2000
45views more  ADCM 2000»
14 years 11 months ago
Training neural networks with noisy data as an ill-posed problem
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...
Martin Burger, Heinz W. Engl
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 9 months ago
Fractionally Predictive Spiking Neurons
Recent experimental work has suggested that the neural firing rate can be interpreted as a fractional derivative, at least when signal variation induces neural adaptation. Here, ...
Sander M. Bohte, Jaldert O. Rombouts
CN
2006
70views more  CN 2006»
14 years 11 months ago
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
Yijie Han, Richard J. La, Armand M. Makowski, Seun...