220 search results - page 4 / 44 » Distributed Minimum Cut Approximation |
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
104
click to vote
COMGEO
2008
ACM
15 years 12 days ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
108
click to vote
ICCV
1999
IEEE
16 years 2 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...