z-logo
open-access-imgOpen Access
Tighter continuous relaxations for MAP inference in discrete MRFs: A survey
Author(s) -
Hariprasad Kannan,
Nikos Komodakis,
Nikos Paragios
Publication year - 2019
Publication title -
handbook of numerical analysis
Language(s) - English
Resource type - Book series
eISSN - 1875-5445
pISSN - 1570-8659
DOI - 10.1016/bs.hna.2019.06.001
Subject(s) - inference , relaxation (psychology) , semidefinite programming , markov chain , computer science , discrete optimization , mathematical optimization , clique , perspective (graphical) , theoretical computer science , linear programming relaxation , linear programming , mathematics , algorithm , optimization problem , combinatorics , machine learning , artificial intelligence , social psychology , psychology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom