121 search results - page 8 / 25 » Distributed Construction of Random Expander Networks |
NN
1998
Springer
14 years 9 months ago
1998
Springer
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
STOC
2004
ACM
15 years 3 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
83
Voted
AC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract—The dynamics of the survival of recruiting fish are analyzed as evolving random processes of aggregation and mortality. The analyses draw on recent advances in the phys...
107
click to vote
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...