186 search results - page 17 / 38 » The Partial Augment-Relabel Algorithm for the Maximum Flow P... |
ICCAD
2000
IEEE
13 years 11 months ago
2000
IEEE
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
IPL
2006
13 years 7 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
WAOA
2005
Springer
14 years 25 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
PIMRC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Consider the problem of resource allocation on the downlink of a cellular OFDMA system. A fairness constraint is defined by a minimum data rate, a maximum bit-error rate and a...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...