9871 search results - page 184 / 1975 » On the Structure of Low Sets |
210
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
264
click to vote
BMVC
2001
15 years 9 months ago
2001
In this paper we present a system that combines the benefits of 3D deformable models and level set methods for medical volume segmentation. Our 3D deformable model is a very comp...
166
click to vote
LOGCOM
2010
15 years 4 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
206
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
136
click to vote
AIMSA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we propose a general and abstract formal setting for argumentative dialogue protocols. We identify a minimal set of basic parameters that characterize dial...