Back to Results
First PageMeta Content
Constraint programming / Operations research / Relaxation / Convex optimization / Linear programming relaxation / Constraint satisfaction problem / Linear programming / Normal distribution / Constraint satisfaction / Mathematical optimization / Mathematics / Applied mathematics


High-arity Interactions, Polyhedral Relaxations, and Cutting Plane Algorithm for Soft Constraint Optimisation (MAP-MRF)
Add to Reading List

Document Date: 2008-08-29 08:22:46


Open Document

File Size: 290,55 KB

Share Result on Facebook

City

Berlin / St. Lambrecht / Hyderabad / Kiev / /

Company

Princeton University Press / Czech Republic Abstract LP / Neural Information Processing Systems / MIT Press / TRW / /

Country

Germany / Austria / India / /

Currency

USD / /

Facility

Graz University of Technology / Glushkov Institute of Cybernetics / Institute of Cybernetics / Czech Technical University / Dresden University of Technology / /

IndustryTerm

energy minimization / plane algorithm / diffusion algorithm / greedy algorithm / nonpolynomial algorithm / combinatorial algorithm / network algorithm / described cutting plane algorithm / scalar product / energy minimization methods / energy / /

Organization

Institute of Cybernetics / MIT / European Commission / Werner Center for Machine Perception / Czech government / Princeton University / USSR Academy of Science / Automatics and Telemechanics / Czech Technical University / Dresden University of Technology / Center for Machine Perception / Department of Cybernetics / Graz University of Technology / Pattern Analysis and Machine Intelligence / /

Person

max b / O. Veksler / V / /

Position

author / primal space RT / space RT / RT / /

ProgrammingLanguage

K / /

Technology

augmenting DAG algorithm / network algorithm / diffusion algorithm / combinatorial algorithm / Cutting Plane Algorithm / images Algorithm / described cutting plane algorithm / nonpolynomial algorithm / end loop The algorithm / CMP / /

SocialTag