1327 search results - page 183 / 266 » Path following algorithm for the graph matching problem |
119
Voted
MICCAI
2010
Springer
15 years 8 days ago
2010
Springer
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
156
click to vote
VLSID
2002
IEEE
15 years 6 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
100
Voted
PARELEC
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
128
Voted
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
123
click to vote
DAM
2007
15 years 1 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...