290 search results - page 7 / 58 » Network as a Computer: Ranking Paths to Find Flows |
JAL
2006
14 years 10 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
100
click to vote
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
102
click to vote
ICCV
2007
IEEE
15 years 12 months ago
2007
IEEE
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Vector fields may come from video data (via optical flow and tracking), from weather phenomena (e.g., wind speed and direction), and from medical imaging. An important component i...
COMGEO
2010
ACM
14 years 10 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...