52 search results - page 2 / 11 » Hyperbolic Programs, and Their Derivative Relaxations |
EMNLP
2010
13 years 6 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
ESOP
2010
Springer
14 years 6 months ago
2010
Springer
The specification of the Java Memory Model (JMM) is phrased in terms of acceptors of execution sequences rather than the standard generative view of operational semantics. This cre...
ISSRE
2007
IEEE
13 years 10 months ago
2007
IEEE
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...