1493 search results - page 282 / 299 » Local resilience of graphs |
SPAA
2009
ACM
14 years 10 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
CVPR
2009
IEEE
14 years 8 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
ICIP
2009
IEEE
14 years 8 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...