Content deleted Content added
Jason Quinn (talk | contribs) →References: cleanup of cite templates |
Jason Quinn (talk | contribs) →References: fixing cite template throwing URL in journal param error |
||
Line 50:
* {{cite journal |last=Ishikawa |first=H. |year=2011 |title=Transformation of general binary MRF minimization to the first order case |journal=[[IEEE Transactions on Pattern Analysis and Machine Intelligence]] |doi=10.1109/tpami.2010.91 |pmid=20421673 |citeseerx=10.1.1.675.2183 |s2cid=17314555 |volume=33 |number=6 |pages=1234–1249}}
* {{cite conference |last1=Kahl |first1=F. |last2=Strandmark |first2=P. |year=2011|title=Generalized Roof Duality for Pseudo-Boolean Optimization |conference=[[International Conference on Computer Vision]] |url=http://www.maths.lth.se/vision/publdb/reports/pdf/kahl-strandmark-iccv-11.pdf}}
* {{cite journal |last=O'Donnell |first=Ryan |year=2008 |title=Some topics in analysis of Boolean functions |journal=ECCC |issn=1433-8092 |url={{ECCC|2008|08|055}}
* {{cite conference |last1=Rother |first1=C. |last2=Kolmogorov |first2=V. |last3=Lempitsky |first3=V. |last4=Szummer |first4=M. |year=2007 |title=Optimizing Binary MRFs via Extended Roof Duality |conference=[[Conference on Computer Vision and Pattern Recognition]] |url=http://research.microsoft.com/pubs/67978/cvpr07-QPBOpi.pdf}}
* Alexander Schrijver. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. Journal of Combinatorial Theory, Series B, Volume 80, Issue 2, November 2000, Pages 346-355.
| |||