Sciweavers

105 search results - page 2 / 21
» Fast mesh segmentation using random walks
Sort
View
ECCV
2008
Springer
14 years 8 months ago
Generative Image Segmentation Using Random Walks with Restart
We consider the problem of multi-label, supervised image segmentation when an initial labeling of some pixels is given. In this paper, we propose a new generative image segmentatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
13 years 10 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
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
13 years 7 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 6 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
PODC
2009
ACM
14 years 4 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...