Sciweavers

3017 search results - page 301 / 604
» On compressing social networks
Sort
View
IPL
2006
72views more  IPL 2006»
15 years 6 months ago
Cayley graphs as models of deterministic small-world networks
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
Wenjun Xiao, Behrooz Parhami
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 7 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
176
Voted
DNIS
2005
Springer
112views Database» more  DNIS 2005»
16 years 9 days ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 11 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
GLOBECOM
2010
IEEE
15 years 4 months ago
Trust Management for Encounter-Based Routing in Delay Tolerant Networks
: We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation...
Ing-Ray Chen, Fenye Bao, Moonjeong Chang, Jin-Hee ...