Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials Shenlong Wang University of Toronto - Polynomial - Document - PDFSEARCH.IO - Document Search Engine

Back to Results

First Page	Meta Content
	Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials Shenlong Wang University of Toronto Add to Reading List Document Date: 2014-12-02 19:01:58 Open Document File Size: 736,04 KB Share Result on Facebook Company SIAM Journal / / / Facility Polynomial Potentials Shenlong Wang University of Toronto Alexander G. Schwing University / Toronto Raquel Urtasun University / / IndustryTerm minimum energy / energy function / energy minimization / bound optimization algorithms / inference algorithm / minimum energy configuration / sub-modular energy functions / message passing algorithms / inference algorithms / approximate energy minimization / natural language processing / recommender systems / lower energy / approximate message-passing algorithms / max-product algorithms / energy / / MusicGroup Error / Ours / Energy / / Organization University of Toronto / / Person Graphical Models / Morgan Kaufmann / / Position Prime Minister / tackle / Cameraman / General / / PublishedMedium Communications of the ACM / American Mathematical Monthly / / Technology Convex max-product algorithms / inference algorithms / natural language processing / FoE inference algorithm / message passing algorithms / inference algorithm / machine learning / approximate message-passing algorithms / bound optimization algorithms / / URL http / SocialTag Convex analysis Polynomials Operations research Mathematical optimization Convex function Convex optimization Vector space Arithmetic circuit complexity Linear programming Algebra