3247 search results - page 188 / 650 » Randomized smoothing networks |
144
click to vote
NIPS
2004
15 years 5 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
131
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Many complex systems, from power grids and the internet, to the brain and society, can be modeled using modular networks. Modules, densely interconnected groups of elements, often...
125
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
We empirically study the effect of mobility and interaction between various input parameters on the performance of protocols designed for wireless ad-hoc networks. An important ob...
125
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
128
click to vote
WSC
2001
15 years 5 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...