1327 search results - page 180 / 266 » Path following algorithm for the graph matching problem |
119
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
134
click to vote
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
133
Voted
IWDC
2005
Springer
15 years 7 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
187
click to vote
CP
2011
Springer
14 years 1 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...