25 search results - page 2 / 5 » Online Maximum Directed Cut |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
TOC
2008
13 years 5 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
IMSCCS
2007
IEEE
13 years 11 months ago
2007
IEEE
TOPSAW program was developed by Dr. S. Chang and his team and has been successfully used in the replication of sawmill cutting to determine the optimal cutting pattern for a log t...
ISAAC
2001
Springer
13 years 10 months ago
2001
Springer
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...