1480 search results - page 109 / 296 » Distributed algorithms for weighted problems in sparse graph... |
SIAMDM
2000
13 years 10 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
ICIP
2008
IEEE
15 years 15 days ago
2008
IEEE
Hashes can be used to provide authentication of multimedia contents. In the case of images, a hash can be used to detect whether the data has been modified in an illegitimate way....
CEC
2008
IEEE
14 years 5 months ago
2008
IEEE
— Many optimisation problems are multi-objective and change dynamically. Many methods use a weighted average approach to the multiple objectives. This paper introduces the usage ...