494 search results - page 56 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
EMNLP
2009
13 years 5 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...
AAIM
2008
Springer
14 years 2 months ago
2008
Springer
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
ESANN
2001
13 years 9 months ago
2001
In sensorimotor behaviour often a great movement execution variability is combined with a relatively low error in reaching the intended goal. This phenomenon can especially be obse...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...