SIGN IN
SIGN UP
Efficiently solving convex relaxations for MAP estimation
Full Text:
PDF
Buy this Article
Authors:
M. Pawan Kumar
University of Oxford
P. H. S. Torr
Oxford Brookes University
Published in:
· Proceeding
ICML '08
Proceedings of the 25th international conference on Machine learning
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-60558-205-4
doi>
10.1145/1390156.1390242
2008 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 16
· Citation Count: 1
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
convex programming
design
linear programming
performance
probabilistic algorithms
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder