What Is Optimized in Tight Convex Relaxations for Multi-Label Problems?

In  IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

Details

TypeInproceedings
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > What Is Optimized in Tight Convex Relaxations for Multi-Label Problems?