Sciweavers

1383 search results - page 48 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
ACL
2003
15 years 1 months ago
Loosely Tree-Based Alignment for Machine Translation
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...
Daniel Gildea
MOC
2000
181views more  MOC 2000»
14 years 11 months ago
Newton's method for overdetermined systems of equations
Abstract. Complexity theoretic aspects of continuation methods for the solution of square or underdetermined systems of polynomial equations have been studied by various authors. I...
Jean-Pierre Dedieu, Mike Shub
TCOM
2010
65views more  TCOM 2010»
14 years 6 months ago
Evaluation of the distance spectrum of variable-length finite-state codes
The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issu...
Claudio Weidmann, Michel Kieffer
COCOON
2006
Springer
15 years 3 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
CORR
2006
Springer
88views Education» more  CORR 2006»
14 years 12 months ago
Polynomial Time Nondimensionalisation of Ordinary Differential Equations via their Lie Point Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
Evelyne Hubert, Alexandre Sedoglavic