732 search results - page 57 / 147 » Termination of Integer Linear Programs |
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
COLING
2010
13 years 2 months ago
2010
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...
EMNLP
2011
12 years 7 months ago
2011
This paper describes an algorithm for exact decoding of phrase-based translation models, based on Lagrangian relaxation. The method recovers exact solutions, with certificates of...
CGO
2009
IEEE
14 years 2 months ago
2009
IEEE
—The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. This model allows programmers to sp...