260 search results - page 51 / 52 » Dynamic Random Geometric Graphs |
309
Voted
PVLDB
2010
15 years 1 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
178
Voted
INFOCOM
2006
IEEE
16 years 23 days ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
176
Voted
IPSN
2004
Springer
16 years 3 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
175
Voted
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
191
Voted
ICCS
2004
Springer
16 years 4 days ago
2004
Springer
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...