61 search results - page 10 / 13 » The diameter of random massive graphs |
173
click to vote
KDD
2006
ACM
16 years 6 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.)...
175
click to vote
PVLDB
2010
15 years 14 days ago
2010
With the increasing deployment and use of GPS-enabled devices, massive amounts of GPS data are becoming available. We propose a general framework for the mining of semantically me...
207
click to vote
INFOCOM
2008
IEEE
16 years 3 days ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
217
click to vote
MST
2010
15 years 14 days ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
179
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...