other,13-3-H05-1101,bq |
</term>
are reported , along with an
<term>
|
exponential time lower-bound
|
</term>
for certain classes of
<term>
algorithms
|
#7489
Two hardness results for the class NP are reported, along with anexponential time lower-bound for certain classes of algorithms that are currently used in the literature. |
other,6-3-H05-1101,bq |
hardness
</term>
results for the class
<term>
|
NP
|
</term>
are reported , along with an
<term>
|
#7482
Two hardness results for the classNP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature. |
tech,20-3-H05-1101,bq |
lower-bound
</term>
for certain classes of
<term>
|
algorithms
|
</term>
that are currently used in the literature
|
#7496
Two hardness results for the class NP are reported, along with an exponential time lower-bound for certain classes ofalgorithms that are currently used in the literature. |
other,8-2-H05-1101,bq |
models
</term>
can be viewed as pairs of
<term>
|
probabilistic context-free grammars
|
</term>
working in a ' synchronous ' way
|
#7465
These models can be viewed as pairs ofprobabilistic context-free grammars working in a 'synchronous' way. |
other,20-1-H05-1101,bq |
been adopted in the literature on
<term>
|
machine translation
|
</term>
. These
<term>
models
</term>
can be
|
#7454
This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature onmachine translation. |
other,4-1-H05-1101,bq |
</term>
. This paper investigates some
<term>
|
computational problems
|
</term>
associated with
<term>
probabilistic
|
#7438
This paper investigates somecomputational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. |
model,1-2-H05-1101,bq |
<term>
machine translation
</term>
. These
<term>
|
models
|
</term>
can be viewed as pairs of
<term>
probabilistic
|
#7458
Thesemodels can be viewed as pairs of probabilistic context-free grammars working in a 'synchronous' way. |
other,1-3-H05-1101,bq |
working in a ' synchronous ' way . Two
<term>
|
hardness
|
</term>
results for the class
<term>
NP
</term>
|
#7477
Twohardness results for the class NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature. |
model,8-1-H05-1101,bq |
computational problems
</term>
associated with
<term>
|
probabilistic translation models
|
</term>
that have recently been adopted in
|
#7442
This paper investigates some computational problems associated withprobabilistic translation models that have recently been adopted in the literature on machine translation. |