Sciweavers

23988 search results - page 371 / 4798
» Social Network Computing
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 6 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
CIKM
2009
Springer
15 years 11 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
154
Voted
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
15 years 4 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 11 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ICSE
2001
IEEE-ACM
15 years 9 months ago
Workshop on Software Engineering and Mobility
Mobility is redefining the hardware and software fabric of distributed systems. Wireless communication allows network hosts to participate in a distributed computation while on t...
Gruia-Catalin Roman, Gian Pietro Picco