729 search results - page 55 / 146 » Solving subgraph isomorphism problems with constraint progra... |
125
Voted
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
90
Voted
EMNLP
2008
15 years 5 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
116
Voted
SIAMJO
2010
14 years 10 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
172
Voted
SAS
1994
Springer
15 years 7 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
130
Voted
JMLR
2006
15 years 3 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...