Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions

Published on Sep 27, 20152107 Views

Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial ti

Related categories