446 search results - page 28 / 90 » A fast algorithm for computing steiner edge connectivity |
72
Voted
ATMOS
2010
14 years 8 months ago
2010
Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So...
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
72
Voted
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
This article introduces a fast algorithm for Connected Component Labeling of binary images called Light Speed Labeling. It is segment-based and a line-relative labeling that was e...
102
click to vote
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...