15 search results - page 1 / 3 » Fast Algorithms for Even Odd Minimum Cuts and Generalization... |
ESA
2000
Springer
13 years 8 months ago
2000
Springer
SODA
1997
ACM
13 years 5 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
ICCV
1999
IEEE
14 years 6 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...
ICIP
2007
IEEE
13 years 11 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
WG
2004
Springer
13 years 10 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...