( en | de | ru )

 

Disambiguation of "Cooper, Martin C."

Author of the publication

copydeleteadd this publication to your clipboard
Linear constraints for the interpretation of line drawings of curved objects.

. Artif. Intell., 119 (1-2): 235-258 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Cooper Baker

Jason Cooper

Simon Cooper

Maria Cooper

Sam Cooper

 

Other publications of authors with the same name

Binarisation for Valued Constraint Satisfaction Problems., , , , , and . SIAM J. Discret. Math., 31 (4): 2279-2300 (2017)Hybrid Tractable Classes of Constraint Problems., and . The Constraint Satisfaction Problem, volume 7 of Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP., , and . CP, volume 7514 of Lecture Notes in Computer Science, page 265-273. Springer, (2012)Compilation of a High-level Temporal Planning Language into PDDL 2.1., , and . ICTAI (2), page 181-188. IEEE Computer Society, (2010)978-0-7695-4263-8.Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract)., , and . CP, volume 8656 of Lecture Notes in Computer Science, page 928-932. Springer, (2014)Domain Reduction for Valued Constraints by Generalising Methods from CSP., , and . CP, volume 11008 of Lecture Notes in Computer Science, page 64-80. Springer, (2018)Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay., , , , and . NeurIPS, (2020)Soft Constraints: Complexity and Multimorphisms., , , and . CP, volume 2833 of Lecture Notes in Computer Science, page 244-258. Springer, (2003)On Singleton Arc Consistency for CSPs Defined by Monotone Patterns., , , and . STACS, volume 96 of LIPIcs, page 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Lightweight Parallel Multi-Agent Epistemic Planning., , , , and . KR, page 274-283. (2020)