Sciweavers

35 search results - page 4 / 7
» Ranking of Closeness Centrality for Large-Scale Social Netwo...
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 6 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
IAT
2009
IEEE
13 years 4 months ago
A Multi-agent Resource Negotiation for Social Welfare
This study seeks to provide scalable and distributed algorithms to solve the resource allocation problem within an agent community. We propose an approach that can be applied to a...
Antoine Nongaillard, Philippe Mathieu
CIKM
2008
Springer
13 years 8 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
ICDCN
2009
Springer
14 years 1 months ago
Flooding-Assisted Threshold Assignment for Aggregate Monitoring in Sensor Networks
The research community has witnessed a large interest in monitoring large scale distributed systems. In these applications typically we wish to monitor a global system condition wh...
Ali Abbasi, Ahmad Khonsari, Mohammad Sadegh Talebi
INFOCOM
2011
IEEE
12 years 10 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...