Sciweavers

2310 search results - page 423 / 462
» Coloring Random Graphs
Sort
View
ICDM
2009
IEEE
211views Data Mining» more  ICDM 2009»
14 years 2 months ago
Discovering Organizational Structure in Dynamic Social Network
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
Jiangtao Qiu, Zhangxi Lin, Changjie Tang, Shaojie ...
INFOCOM
2009
IEEE
14 years 2 months ago
Respondent-Driven Sampling for Characterizing Unstructured Overlays
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
Amir Hassan Rasti, Mojtaba Torkjazi, Reza Rejaie, ...
INFOCOM
2008
IEEE
14 years 2 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
INFOCOM
2008
IEEE
14 years 2 months ago
Cross-Monotonic Multicast
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
Zongpeng Li
INFOCOM
2008
IEEE
14 years 2 months ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...