Sciweavers

3247 search results - page 110 / 650
» Randomized smoothing networks
Sort
View
FOCS
2006
IEEE
15 years 10 months ago
Fault-Tolerant Distributed Computing in Full-Information Networks
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanatha...
ICN
2001
Springer
15 years 8 months ago
Secure Communication: A New Application for Active Networks
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...
Manuel Günter, Marc Brogle, Torsten Braun
161
Voted
JMLR
2012
13 years 6 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
127
Voted
ICC
2007
IEEE
124views Communications» more  ICC 2007»
15 years 10 months ago
On the Connected Nodes Position Distribution in Ad Hoc Wireless Networks with Statistical Channel Models
—In this paper the problem of evaluating the statistics of the connected nodes position in a multi-hop wireless random ad hoc network is addressed. In particular, an analytical m...
Davide Dardari
CORR
2012
Springer
210views Education» more  CORR 2012»
13 years 11 months ago
Topological phase transition in a network model with preferential attachment and node removal
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. U...
Heiko Bauke, Cristopher Moore, Jean-Baptiste Rouqu...