1090 search results - page 111 / 218 » Priority Algorithms for Graph Optimization Problems |
101
click to vote
TCS
2008
15 years 2 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
129
click to vote
ICDM
2010
IEEE
15 years 4 days ago
2010
IEEE
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
107
Voted
GD
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
134
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
132
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...