Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
Emanuele Frandi, Maria Grazia Gasparo, Stefano Lod...
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
: Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of res...
Abstract. We present a novel algorithm for approximating the parameters of a multivariate t-distribution. At the expense of a slightly decreased accuracy in the estimates, the prop...