Sciweavers

54 search results - page 5 / 11
» Flow trees for vertex-capacitated networks
Sort
View
DAM
2006
100views more  DAM 2006»
13 years 7 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
JNCA
2008
123views more  JNCA 2008»
13 years 7 months ago
Edge-limited scalable QoS flow set-up
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up with...
James Lembke, Byung Kyu Choi
GLOBECOM
2008
IEEE
13 years 7 months ago
Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
Vahid Shah-Mansouri, Vincent W. S. Wong
ACSAC
2003
IEEE
14 years 19 days ago
Behavioral Authentication of Server Flows
Understanding the nature of the information flowing into and out of a system or network is fundamental to determining if there is adherence to a usage policy. Traditional methods...
James P. Early, Carla E. Brodley, Catherine Rosenb...
TMA
2010
Springer
137views Management» more  TMA 2010»
13 years 5 months ago
K-Dimensional Trees for Continuous Traffic Classification
Abstract. The network measurement community has proposed multiple machine learning (ML) methods for traffic classification during the last years. Although several research works ha...
Valentín Carela-Español, Pere Barlet...