2487 search results - page 202 / 498 » Partitions of Graphs into Trees |
102
click to vote
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
128
click to vote
ICALP
1995
Springer
15 years 7 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
161
click to vote
CVPR
2010
IEEE
16 years 7 days ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
144
click to vote
DAM
2010
15 years 3 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
172
click to vote
COMBINATORICA
2011
14 years 3 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...