1327 search results - page 147 / 266 » Path following algorithm for the graph matching problem |
159
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
142
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
155
click to vote
ENDM
2008
15 years 4 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
133
Voted
DAM
2002
15 years 3 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
135
click to vote
ENDM
2010
15 years 1 months ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...