Sciweavers

3247 search results - page 97 / 650
» Randomized smoothing networks
Sort
View
CAAN
2007
Springer
15 years 10 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
CN
2010
121views more  CN 2010»
15 years 17 days ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
129
Voted
IBPRIA
2007
Springer
15 years 10 months ago
Bayesian Oil Spill Segmentation of SAR Images Via Graph Cuts
Abstract. This paper extends and generalizes the Bayesian semisupervised segmentation algorithm [1] for oil spill detection using SAR images. In the base algorithm on which we buil...
Sónia Pelizzari, José M. Bioucas-Dia...
DAS
2008
Springer
15 years 5 months ago
Super-Resolution of Text Images Using Edge-Directed Tangent Field
This paper presents an edge-directed super-resolution algorithm for gray level document images without using any training set. This technique creates an image with smooth regions ...
Jyotirmoy Banerjee, C. V. Jawahar
SPIRE
2010
Springer
15 years 2 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie