199 search results - page 9 / 40 » Fast Algorithms for Computing Tree LCS |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a new fast approach for surface segmentation of thin structures, like vessels and vascular trees, based on Fast Marching and Level Sets methods. Fast Marching allows se...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
SGP
2004
13 years 9 months ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
CIAC
2000
Springer
13 years 11 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...