Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
JaeMo Sung, Sung Yang Bang, Seungjin Choi, Zoubin ...
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
We develop a new algorithm for clustering search results. Differently from many other clustering systems that have been recently proposed as a post-processing step for Web search ...
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...
Anthony M. Castaldo, R. Clint Whaley, Anthony T. C...
Abstract— In this paper, we present a novel fair queue management algorithm called Stochastic RED (StoRED), inspired by the well known stochastic fair queuing and based on the ra...