100 search results - page 16 / 20 » Approximation Algorithms for Geometric Intersection Graphs |
SASO
2008
IEEE
14 years 1 months ago
2008
IEEE
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Automated detection of lesions in retinal images can assist
in early diagnosis and screening of a common disease:
Diabetic Retinopathy. A robust and computationally
efficient ap...
MOBIHOC
2002
ACM
14 years 7 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...
IJCV
2012
11 years 9 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...