364 search results - page 7 / 73 » Computing Communities in Large Networks Using Random Walks |
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
109
Voted
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
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...
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
103
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...