307 search results - page 5 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
ALGORITHMICA
2006
13 years 7 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
JMIV
1998
13 years 7 months ago
1998
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a novel algorithm for unsupervised texture segmentation. We incorporate a set of texture features under a segmentation framework, based on the active contour w...
COR
2011
13 years 2 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...