Sciweavers

767 search results - page 8 / 154
» On Clustering Using Random Walks
Sort
View
TVCG
2011
136views more  TVCG 2011»
13 years 3 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—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...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 8 months ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: 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...
Satyen Kale, C. Seshadhri
CIKM
2005
Springer
14 years 2 months ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 3 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
MM
2006
ACM
190views Multimedia» more  MM 2006»
14 years 2 months ago
Image annotation refinement using random walk with restarts
Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefo...
Changhu Wang, Feng Jing, Lei Zhang, HongJiang Zhan...