1439 search results - page 5 / 288 » Fast approximation of centrality |
IPPS
2005
IEEE
14 years 4 months ago
2005
IEEE
Scalability of clusters and MPPs is typically discussed in terms of limits on growth: something which grows at a rate of O(log p) (where p is the number of processors) is said to ...
STACS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
PAKDD
2010
ACM
14 years 3 months ago
2010
ACM
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...
EDBT
2010
ACM
14 years 5 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
JSCIC
2010
13 years 5 months ago
2010
In this paper, a central discontinuous Galerkin method is proposed to solve for the viscosity solutions of Hamilton-Jacobi equations. Central discontinuous Galerkin methods were or...