Sciweavers

856 search results - page 71 / 172
» On Randomness Measures for Social Networks.
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Latent social structure in open source projects
Commercial software project managers design project organizational structure carefully, mindful of available skills, division of labour, geographical boundaries, etc. These organi...
Christian Bird, David S. Pattison, Raissa M. D'Sou...
P2P
2009
IEEE
126views Communications» more  P2P 2009»
16 years 1 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 6 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
NOMS
2006
IEEE
169views Communications» more  NOMS 2006»
16 years 9 days ago
Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering
—This paper presents a new method, BART (Bandwidth Available in Real-Time), for estimating the end-toend available bandwidth over a network path. It estimates bandwidth quasi-con...
Svante Ekelin, Martin Nilsson, Erik Hartikainen, A...
TC
2010
15 years 1 months ago
SALSA: Strategyproof Online Spectrum Admissions for Wireless Networks
It is imperative to design efficient and effective online spectrum allocation methods since requests for spectrums often come in an online fashion. In this paper, we propose SALSA,...
Ping Xu, ShiGuang Wang, Xiang-Yang Li