446 search results - page 24 / 90 » A fast algorithm for computing steiner edge connectivity |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
94
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
GD
2004
Springer
15 years 3 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Image blur is caused by a number of factors such as motion, defocus, capturing light over the non-zero area of the aperture and pixel, the presence of anti-aliasing filters on a c...
IJCV
2002
14 years 9 months ago
2002
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...