32 search results - page 3 / 7 » Local Convergence of Random Graph Colorings |
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
15 years 11 days ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
IPSN
2005
Springer
13 years 10 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
ICIP
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
PAMI
2010
13 years 3 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...