118 search results - page 21 / 24 » Performance of random walks in one-hop replication networks |
IWQOS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
ICDE
2008
IEEE
14 years 2 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
IPSN
2011
Springer
12 years 12 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
SPAA
2004
ACM
14 years 1 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...