Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Here we present a model of a subtype of one-line jokes (not puns) that describes the relationship between the connector (part of the setup) and the disjunctor (often called the pun...
We study how the error of an ensemble regression estimator can be decomposed into two components: one accounting for the individual errors and the other accounting for the correlat...
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...
Nikos A. Vlassis, Yiannis Sfakianakis, Wojtek Kowa...
The Dirichlet compound multinomial (DCM) distribution has recently been shown to be a good model for documents because it captures the phenomenon of word burstiness, unlike standar...