Sciweavers

Share
20 search results - page 4 / 4
» wea 2010
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
10 years 1 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
9 years 5 months ago
Realtime Classification for Encrypted Traffic
Classifying network flows by their application type is the backbone of many crucial network monitoring and controlling tasks, including billing, quality of service, security and tr...
Roni Bar-Yanai, Michael Langberg, David Peleg, Lia...
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
10 years 2 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
10 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
10 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
books