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...
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
This paper describes the ICFHR 2010 Contest for quantitative evaluation of binarization algorithms. These algorithm are applied to synthetic images of modern pdf documents with noi...
Roberto Paredes, Ergina Kavallieratou, Rafael Duei...
In this paper, we describe recent progress in i-vector based speaker verification. The use of universal background models (UBM) with full-covariance matrices is suggested and tho...
Pavel Matejka, Ondrej Glembek, Fabio Castaldo, M. ...
While there are a number of subjectivity lexicons available for research purposes, none can be used commercially. We describe the process of constructing subjectivity lexicon(s) fo...