Sciweavers

182 search results - page 5 / 37
» Simple Generalized Maximum Flow Algorithms
Sort
View
FOCS
1997
IEEE
13 years 12 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
JSAC
2010
116views more  JSAC 2010»
13 years 2 months ago
Utility-based asynchronous flow control algorithm for wireless sensor networks
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...
Jiming Chen, WeiQiang Xu, Shibo He, Youxian Sun, P...
TON
2008
135views more  TON 2008»
13 years 7 months ago
Measurement-based admission control at edge routers
Abstract-- It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS)...
Seung Yeob Nam, Sunggon Kim, Dan Keun Sung
ECCV
2002
Springer
14 years 9 months ago
Resolution Selection Using Generalized Entropies of Multiresolution Histograms
The performances of many image analysis tasks depend on the image resolution at which they are applied. Traditionally, resolution selection methods rely on spatial derivatives of i...
Efstathios Hadjidemetriou, Michael D. Grossberg, S...
STACS
1994
Springer
13 years 11 months ago
On the Complexity of the Maximum Cut Problem
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
Hans L. Bodlaender, Klaus Jansen