Sciweavers

5606 search results - page 585 / 1122
» Randomization Techniques for Graphs.
Sort
View
NAA
2000
Springer
104views Mathematics» more  NAA 2000»
15 years 10 months ago
A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
Todor V. Gurov, Paula A. Whitlock, Ivan Dimov
WSC
2007
15 years 9 months ago
Feasibility study of variance reduction in the logistics composite model
The Logistics Composite Model (LCOM) is a stochastic, discrete-event simulation that relies on probabilities and random number generators to model scenarios in a maintenance unit ...
George P. Cole III, Alan W. Johnson, J. O. Miller
CCS
2008
ACM
15 years 9 months ago
Certificateless signcryption
Certificateless cryptography achieves the best of the two worlds: it inherits from identity-based techniques a solution to the certificate management problem in public-key encrypti...
Manuel Barbosa, Pooya Farshim
ESANN
2007
15 years 8 months ago
An overview of reservoir computing: theory, applications and implementations
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
Benjamin Schrauwen, David Verstraeten, Jan M. Van ...
ESANN
2008
15 years 8 months ago
Pruning and Regularisation in Reservoir Computing: a First Insight
Reservoir Computing is a new paradigm for using Recurrent Neural Networks which shows promising results. However, as the recurrent part is created randomly, it typically needs to b...
Xavier Dutoit, Benjamin Schrauwen, Jan M. Van Camp...