The expectation maximization (EM) algorithm is widely used in the Gaussian mixture model (GMM) as the state-of-art statistical modeling technique. Like the classical EM method, th...
Sheeraz Memon, Margaret Lech, Namunu Chinthaka Mad...
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...