130 search results - page 6 / 26 » XQL and proximal nodes |
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
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...
WD
2010
13 years 8 months ago
2010
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...
ICWSM
2009
13 years 8 months ago
2009
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...
ICCHP
2004
Springer
14 years 4 months ago
2004
Springer
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...
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
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...