Sciweavers

364 search results - page 15 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
BROADNETS
2004
IEEE
15 years 1 months ago
Handheld Routers: Intelligent Bandwidth Aggregation for Mobile Collaborative Communities
Multi-homed, mobile wireless computing and communication devices can spontaneously form communities to logically combine and share the bandwidth of each other's wide-area com...
Puneet Sharma, Sung-Ju Lee, Jack Brassil, Kang G. ...
IMC
2010
ACM
14 years 7 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 9 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
PAM
2005
Springer
15 years 2 months ago
Analysis of Communities of Interest in Data Networks
Abstract. Communities of interest (COI) have been applied in a variety of environments ranging from characterizing the online buying behavior of individuals to detecting fraud in t...
William Aiello, Charles R. Kalmanek, Patrick Drew ...
GCC
2003
Springer
15 years 2 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu