Sciweavers

1897 search results - page 68 / 380
» Sparse Additive Machine
Sort
View
103
Voted
COLING
2008
15 years 2 months ago
Regenerating Hypotheses for Statistical Machine Translation
This paper studies three techniques that improve the quality of N-best hypotheses through additional regeneration process. Unlike the multi-system consensus approach where multipl...
Boxing Chen, Min Zhang, AiTi Aw, Haizhou Li
83
Voted
COLING
2010
14 years 7 months ago
Local lexical adaptation in Machine Translation through triangulation: SMT helping SMT
We present a framework where auxiliary MT systems are used to provide lexical predictions to a main SMT system. In this work, predictions are obtained by means of pivoting via aux...
Josep Maria Crego, Aurélien Max, Fran&ccedi...
COMBINATORICA
2010
14 years 10 months ago
A superadditivity and submultiplicativity property for cardinalities of sumsets
For finite sets of integers A1, A2 . . . An we study the cardinality of the n-fold sumset A1 +
Katalin Gyarmati, Máté Matolcsi, Imr...
96
Voted
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
15 years 6 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
CAV
2003
Springer
127views Hardware» more  CAV 2003»
15 years 4 months ago
Dense Counter Machines and Verification Problems
We generalize the traditional definition of a multicounter machine (where the counters, which can only assume nonnegative integer values, can be incremented/decremented by 1 and te...
Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi S...