Sciweavers

207 search results - page 42 / 42
» The Polynomial Method for Random Matrices
Sort
View
145
Voted
AI
2010
Springer
15 years 2 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
133
Voted
JMLR
2008
150views more  JMLR 2008»
15 years 2 months ago
Discriminative Learning of Max-Sum Classifiers
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
Vojtech Franc, Bogdan Savchynskyy