750 search results - page 26 / 150 » Reconstruction for Models on Random Graphs |
ISTCS
1993
Springer
14 years 17 days ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In this contribution the radio channel model proposed in [1] is extended to include multiple transmitters and receivers. The propagation environment is modelled using r...
SIGECOM
2006
ACM
14 years 2 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
CCCG
2010
13 years 10 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...