Sciweavers

530 search results - page 20 / 106
» Universal randomized switching
Sort
View
ECCV
2010
Springer
15 years 7 months ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
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...
ECCV
2008
Springer
16 years 6 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...
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
14 years 11 months ago
Efficient Detection of Errors in Java Components Using Random Environment and Restarts
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
Pavel Parizek, Tomás Kalibera
DCG
2008
104views more  DCG 2008»
15 years 1 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger