In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delaytolerant network. The scheme uses recent encounters to estimate the avail...
In spite of enormous previous efforts to model the growth of various networks, there have only been a few works that successfully describe the evolution of latent networks. In a l...
David tries not to use unfamiliar trains and buses, he doesn’t travel to places he doesn’t know, and he doesn’t travel in unusual environments without a companion. David is v...
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...