Sciweavers

933 search results - page 1 / 187
» Centrality Estimation in Large Networks
Sort
View
IJBC
2007
72views more  IJBC 2007»
13 years 4 months ago
Centrality Estimation in Large Networks
Centrality indices are an essential concept in network analysis. For those based on shortest-path distances the computation is at least quadratic in the number of nodes, since it ...
Ulrik Brandes, Christian Pich
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 6 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 6 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
ICC
2009
IEEE
214views Communications» more  ICC 2009»
13 years 11 months ago
Optical Broadcast-and-Select Network Architecture with Centralized Multi-Carrier Light Source
Abstract: We propose an optical broadcast-and-select network architecture with centralized multi-carrier light source (C-MCLS). It enables all network nodes access a large number o...
Yueping Cai, Eiji Oki, Motoharu Matsuura, Naoto Ki...
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf