649 search results - page 90 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
ESA
2006
Springer
14 years 16 days ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
MP
2006
13 years 8 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...