1327 search results - page 131 / 266 » Path following algorithm for the graph matching problem |
154
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
127
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
170
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
168
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
129
click to vote
3DOR
2009
15 years 5 months ago
2009
Most of the approaches which address the problem of 3D object retrieval, use global descriptors of the objects which fail to consistently compensate for the intra-class variabilit...