307 search results - page 3 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
ALGORITHMICA
2004
13 years 7 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
ICRA
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
IJCV
2007
13 years 7 months ago
2007
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
CIARP
2008
Springer
13 years 9 months ago
2008
Springer
The concept of elongation is generally well understood. However, there is no clear, precise, mathematical definition of elongation in any dictionary we could find. We propose that ...