Sciweavers

EMNLP
2009
13 years 2 months ago
Better Synchronous Binarization for Machine Translation
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...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
CCS
2009
ACM
13 years 11 months ago
Attacking cryptographic schemes based on "perturbation polynomials"
We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use ...
Martin Albrecht, Craig Gentry, Shai Halevi, Jonath...