1963 search results - page 96 / 393 » The Maximum Solution Problem on Graphs |
127
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
107
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
107
Voted
PAMI
2006
15 years 2 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
121
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
113
click to vote
GD
2004
Springer
15 years 8 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...