Sciweavers

5153 search results - page 139 / 1031
» Introduction to Randomized Algorithms
Sort
View
149
Voted
MICCAI
2010
Springer
15 years 15 days ago
Fast Random Walker with Priors Using Precomputation for Interactive Medical Image Segmentation
Abstract. Updating segmentation results in real-time based on repeated user input is a reliable way to guarantee accuracy, paramount in medical imaging applications, while making e...
Shawn Andrews, Ghassan Hamarneh, Ahmed Saad
264
Voted
CVPR
2011
IEEE
14 years 10 months ago
Hyper-graph Matching via Reweighted Random Walks
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...
Jungmin Lee (Seoul National University), Minsu Cho...
122
Voted
STOC
2005
ACM
139views Algorithms» more  STOC 2005»
16 years 2 months ago
Spectral norm of random matrices
We study the spectral norm of matrices M that can be factored as M = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + )-th ...
Van H. Vu
145
Voted
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 9 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 7 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu