Sciweavers

89 search results - page 10 / 18
» Randomizing Social Networks: a Spectrum Preserving Approach
Sort
View
CSE
2009
IEEE
15 years 4 months ago
Inferring Unobservable Inter-community Links in Large Social Networks
Abstract—Social networks can be used to model social interactions between individuals. In many circumstances, not all interactions between individuals are observed. In such cases...
Heath Hohwald, Manuel Cebrián, Arturo Canal...
158
Voted
CP
2009
Springer
15 years 10 months ago
On the Structure of Industrial SAT Instances
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
Carlos Ansótegui, Jordi Levy, Maria Luisa B...
SAC
2009
ACM
15 years 4 months ago
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
Gian Paolo Jesi, Edoardo Mollona, Srijith K. Nair,...
ICDM
2007
IEEE
182views Data Mining» more  ICDM 2007»
15 years 3 months ago
Co-ranking Authors and Documents in a Heterogeneous Network
The problem of evaluating scientific publications and their authors is important, and as such has attracted increasing attention. Recent graph-theoretic ranking approaches have d...
Ding Zhou, Sergey A. Orshanskiy, Hongyuan Zha, C. ...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu