Sciweavers

4642 search results - page 613 / 929
» Distributed algorithm and reversible network
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 11 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
SIGCOMM
2012
ACM
13 years 9 months ago
ShadowStream: performance evaluation as a capability in production internet live streaming networks
As live streaming networks grow in scale and complexity, they are becoming increasingly difficult to evaluate. Existing evaluation methods including lab/testbed testing, simulati...
Chen Tian, Richard Alimi, Yang Richard Yang, David...
CCR
2005
76views more  CCR 2005»
15 years 6 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
INFOCOM
2006
IEEE
16 years 24 days ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee