933 search results - page 27 / 187 » Centrality Estimation in Large Networks |
DBKDA
2010
IEEE
14 years 8 months ago
2010
IEEE
—Emerging Web2.0 applications such as virtual worlds or social networking websites strongly differ from usual OLTP applications. First, the transactions are encapsulated in an AP...
MOBICOM
2003
ACM
15 years 3 months ago
2003
ACM
Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent...
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—Hyperbolic position bounding (HPB) provides a mechanism to probabilistically delimit the location of a wireless network malicious insider to a candidate area. A large scale path...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...