93 search results - page 7 / 19 » Fast Random Walk with Restart and Its Applications |
107
click to vote
JSS
2010
14 years 4 months ago
2010
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Mot...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
A fast and robust auto-sorting method for image ordering based on Markov Random Fields (MRF) is proposed. We present a specific MRF model for the ordering problem and use pairwis...
ICDE
2008
IEEE
15 years 4 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
15 years 3 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 ...
ALT
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts