Sciweavers

1639 search results - page 13 / 328
» Degree-constrained network flows
Sort
View
ICC
2009
IEEE
165views Communications» more  ICC 2009»
13 years 7 months ago
Coding-Aware Scheduling for Reliable Many-to-One Flows
We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance o...
Osameh M. Al-Kofahi, Ahmed E. Kamal
PAM
2011
Springer
13 years 20 days ago
Evolution of Cache Replacement Policies to Track Heavy-Hitter Flows
Several important network applications cannot easily scale to higher data rates without requiring focusing just on the large traffic flows. Recent works have discussed algorithmic...
Martin Zádník, Marco Canini
NETWORKS
2006
13 years 9 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran
INFOCOM
2003
IEEE
14 years 3 months ago
A Unifying Passivity Framework for Network Flow Control
—Network flow control regulates the traffic between sources and links based on congestion, and plays a critical role in ensuring satisfactory performance. In recent studies, glob...
John T. Wen, Murat Arcak
COMPSYSTECH
2009
13 years 7 months ago
A Bayesian approach to recognise facial expressions using vector flows
: Facial expressions play an important role in human nonverbal communication. They can be generated by activation and dilatation of facial muscles. In this paper we describe a syst...
Xiaofan Sun, Léon J. M. Rothkrantz, Dragos ...