3247 search results - page 299 / 650 » Randomized smoothing networks |
130
click to vote
OPODIS
2004
15 years 7 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
134
click to vote
NIPS
2001
15 years 7 months ago
2001
We describe a neural network which enhances and completes salient closed contours. Our work is different from all previous work in three important ways. First, like the input prov...
172
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in t...
147
click to vote
ANOR
2006
15 years 6 months ago
2006
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...