Sciweavers

1998 search results - page 71 / 400
» Complexity of the Cover Polynomial
Sort
View
IH
2005
Springer
14 years 3 months ago
On the Intractability of Inverting Geometric Distortions in Watermarking Schemes
We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reduct...
Maciej Liskiewicz, Ulrich Wölfel
ACL
2003
13 years 11 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»
13 years 9 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»
13 years 4 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
14 years 1 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...