1327 search results - page 69 / 266 » Path following algorithm for the graph matching problem |
111
click to vote
ICPP
2006
IEEE
15 years 7 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
106
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
139
click to vote
COLOGNETWENTE
2010
15 years 10 days ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
97
Voted
JCT
1998
15 years 1 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
133
click to vote
IJCV
2006
15 years 1 months ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...