15 search results - page 3 / 3 » Recovering Social Networks From Massive Track Datasets |
KDD
2005
ACM
13 years 10 months ago
2005
ACM
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
: Applications such as Second Life require massive deployment of servers worldwide to support a large number of users. We investigate experimentally how Peer-to-Peer (P2P) communic...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...