Sciweavers

1778 search results - page 66 / 356
» On the Power of the Randomized Iterate
Sort
View
IJCNN
2007
IEEE
15 years 4 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
ECCV
2010
Springer
15 years 3 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
2006
IEEE
15 years 12 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ICIP
1998
IEEE
15 years 11 months ago
Adaptive Restoration of Speckled SAR Images using a Compound Random Markov Field
This paper proposes a restoration scheme for noisy images generated by coherent imaging systems (e.g., synthetic aperture radar, synthetic aperture sonar, ultrasound imaging, and ...
José M. B. Dias, José M. N. Leit&ati...
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 1 months ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin