Sciweavers

Share
15 search results - page 1 / 3
» Fast Algorithms for Even Odd Minimum Cuts and Generalization...
Sort
View
ESA
2000
Springer
96views Algorithms» more  ESA 2000»
10 years 6 months ago
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations
András A. Benczúr, Ottilia Fül&...
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
10 years 3 months ago
Fast Approximate Graph Partitioning Algorithms
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...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
ICCV
1999
IEEE
11 years 4 months ago
Fast Approximate Energy Minimization via Graph Cuts
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...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICIP
2007
IEEE
10 years 9 months ago
Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression
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...
Maria Trocan, Béatrice Pesquet-Popescu, Jam...
WG
2004
Springer
10 years 8 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
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...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
books