446 search results - page 55 / 90 » A fast algorithm for computing steiner edge connectivity |
SODA
1992
ACM
14 years 10 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
106
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
104
click to vote
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
ALENEX
2009
14 years 10 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
SODA
2007
ACM
14 years 11 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...