3247 search results - page 31 / 650 » Randomized smoothing networks |
160
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
134
click to vote
EJC
2008
15 years 3 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
148
click to vote
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
: We presented and evaluated a new Bayesian method for range image segmentation. The method proceeds in to stages. First, an initial segmentation was produced by a randomized regio...
128
click to vote
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
155
click to vote
OPODIS
2004
15 years 5 months ago
2004
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...