860 search results - page 23 / 172 » Biased Random Walks |
MICCAI
2005
Springer
14 years 11 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...
ICALP
2009
Springer
14 years 11 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...
TVCG
2011
13 years 5 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
KDD
2009
ACM
14 years 11 months ago
2009
ACM
Collaborative filtering is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it cannot make recommendations ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...