Sciweavers

3247 search results - page 31 / 650
» Randomized smoothing networks
Sort
View
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 3 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
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...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
EJC
2008
14 years 12 months ago
Expansion properties of a random regular graph after random vertex deletions
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-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
EMMCVPR
2007
Springer
15 years 6 months ago
A New Bayesian Method for Range Image Segmentation
: 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...
Smaine Mazouzi, Mohamed Batouche
INFOCOM
2005
IEEE
15 years 5 months ago
Non-uniform random membership management in peer-to-peer networks
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
Ming Zhong, Kai Shen, Joel I. Seiferas
OPODIS
2004
15 years 1 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
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...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...