290 search results - page 14 / 58 » Balancing Applied to Maximum Network Flow Problems |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Probabilistic graphical models such as Bayesian Networks have been increasingly applied to many computer vision problems. Accuracy of inferences in such models depends on the quali...
PAM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper we present OpenTM, a traffic matrix estimation system for OpenFlow networks. OpenTM uses built-in features provided in OpenFlow switches to directly and acc...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
ICCS
2009
Springer
14 years 2 months ago
2009
Springer
BOINC is a middleware for Volunteer Computing. In BOINC projects, heterogeneous resources distributed across the Internet are used for large-scale scientific simulations. The larg...
JCO
2010
13 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...