500 search results - page 18 / 100 » Approximation algorithms for maximum independent set of pseu... |
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
125
click to vote
IPMI
2007
Springer
16 years 2 months ago
2007
Springer
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
117
click to vote
SIAMCOMP
2002
15 years 1 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
112
click to vote
IPL
2008
15 years 1 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
114
click to vote
SIROCCO
2008
15 years 3 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...