Sciweavers

3495 search results - page 364 / 699
» On the random satisfiable process
Sort
View
INFOCOM
2010
IEEE
15 years 7 months ago
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 4 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
CCGRID
2005
IEEE
16 years 13 days ago
Dynamic load balancing experiments in a grid
Connected world-widely distributed computers and data systems establish a global source of processing power and data, called a grid. Key properties of a grid are the fact that com...
Menno Dobber, Ger Koole, Robert D. van der Mei
195
Voted
INFOCOM
2003
IEEE
16 years 3 days ago
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
— A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data ...
Seema Bandyopadhyay, Edward J. Coyle
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 6 months ago
Interference and Outage in Clustered Wireless Ad Hoc Networks
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
Radha Krishna Ganti, Martin Haenggi