733 search results - page 21 / 147 » Recommending random walks |
94
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
188
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
EMNLP
2011
13 years 9 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
127
click to vote
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
A new approach to interactive segmentation based on random walks was recently introduced that shows promise for allowing physicians more flexibility to segment arbitrary objects in...
101
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...