733 search results - page 63 / 147 » Recommending random walks |
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
110
click to vote
ADHOCNOW
2004
Springer
15 years 3 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
ENTER
2009
Springer
15 years 4 months ago
2009
Springer
Mobile devices are becoming an inseparable part of our lives and personalized location-based mobile services are gaining more and more popularity. The scope of this paper is to il...
100
click to vote
ICML
2008
IEEE
15 years 10 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...