136 search results - page 19 / 28 » Experimental Study of Minimum Cut Algorithms |
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
How to adaptively choose optimal neighborhoods is very important to pixel-domain image denoising algorithms since too many neighborhoods may cause over-smooth artifacts and too fe...
GCC
2003
Springer
15 years 2 months ago
2003
Springer
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
PDPTA
2007
14 years 11 months ago
2007
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...