250 search results - page 5 / 50 » Linear Text Segmentation using a Dynamic Programming Algorit... |
NLE
2007
13 years 7 months ago
2007
We address the problem of extracting bilingual chunk pairs from parallel text to create training sets for statistical machine translation. We formulate the problem in terms of a s...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
ISBI
2006
IEEE
14 years 8 months ago
2006
IEEE
Given a volume of cardiac MR images, we consider the problem of segmenting the heart based on intensity and dynamics. We first segment the heart and the chest from the background ...
AUTOMATICA
2011
13 years 2 months ago
2011
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
MP
2006
13 years 7 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...