Sciweavers

6696 search results - page 1253 / 1340
» Securing social networks
Sort
View
WWW
2011
ACM
13 years 5 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
TSP
2010
13 years 4 months ago
Distributed learning in multi-armed bandit with multiple players
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
Keqin Liu, Qing Zhao
CORR
2011
Springer
217views Education» more  CORR 2011»
13 years 1 months ago
Coarse-Grained Topology Estimation via Graph Sampling
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
CORR
2011
Springer
195views Education» more  CORR 2011»
13 years 1 months ago
Collective response of human populations to large-scale emergencies
Despite recent advances in uncovering the quantitative features of stationary human activity patterns, many applications, from pandemic prediction to emergency response, require a...
James P. Bagrow, Dashun Wang, Albert-Lászl&...
WSDM
2012
ACM
334views Data Mining» more  WSDM 2012»
12 years 5 months ago
mTrust: discerning multi-faceted trust in a connected world
Traditionally, research about trust assumes a single type of trust between users. However, trust, as a social concept, inherently has many facets indicating multiple and heterogen...
Jiliang Tang, Huiji Gao, Huan Liu
« Prev « First page 1253 / 1340 Last » Next »