Sciweavers

3247 search results - page 268 / 650
» Randomized smoothing networks
Sort
View
SIGCOMM
1993
ACM
15 years 10 months ago
The Synchronization of Periodic Routing Messages
The paper considers a network with many apparently-independent periodic processes and discusses one method by which these processes can inadvertently become synchronized. In parti...
Sally Floyd, Van Jacobson
ESANN
2007
15 years 7 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 7 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...
WSC
2004
15 years 7 months ago
Decision Tree Module Within Decision Support Simulation System
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
Mohamed Moussa, Janaka Y. Ruwanpura, George Jergea...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win