100 search results - page 18 / 20 » Approximation Algorithms for the Unsplittable Flow Problem |
SIAMSC
2008
13 years 7 months ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
ICCV
2009
IEEE
15 years 21 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Limited bandwidth and high packet loss pose a serious challenge for video streaming over wireless networks. Even when packet loss in the medium is not present, the fluctuating ava...