1377 search results - page 12 / 276 » Statistical Machine Reordering |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
TON
2010
13 years 3 months ago
2010
Abstract--This paper proposes KISS, a novel Internet classification engine. Motivated by the expected raise of UDP traffic, which stems from the momentum of P2P streaming applicati...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
We introduce a framework for reordering join pipelines at runtime in a database system. This framework incorporates novel techniques for simulating the execution of a join pipeline...
COLING
2010
13 years 3 months ago
2010
Phrase-based statistical MT (SMT) is a milestone in MT. However, the translation model in the phrase based SMT is structure free which greatly limits its reordering capacity. To a...