1379 search results - page 189 / 276 » The Complexity of the Annihilating Polynomial |
195
click to vote
EMNLP
2009
15 years 4 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
166
click to vote
ICAI
2009
15 years 4 months ago
2009
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
204
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
149
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
209
click to vote
CORR
2011
Springer
15 years 27 days ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...