557 search results - page 11 / 112 » On the set multi-cover problem in geometric settings |
222
click to vote
MST
2010
15 years 24 days ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
152
click to vote
IPCO
2004
15 years 7 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
169
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
148
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
175
click to vote
CVBIA
2005
Springer
15 years 11 months ago
2005
Springer
We present a novel framework to exert topology control over a level set evolution. Level set methods offer several advantages over parametric active contours, in particular automat...