1327 search results - page 168 / 266 » Path following algorithm for the graph matching problem |
146
click to vote
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
122
click to vote
ICIP
2003
IEEE
16 years 3 months ago
2003
IEEE
This article addresses the problem of road extraction from new high resolution satellite images. The proposed algorithm is divided in two sequential modules : a topologically corr...
135
click to vote
RECOMB
1998
Springer
15 years 6 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
116
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
113
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...