This work presents a study to bridge topic modeling and personalized search. A probabilistic topic model is used to extract topics from user search history. These topics can be se...
: This paper addresses the inference of probabilistic classification models using weakly supervised learning. The main contribution of this work is the development of learning meth...
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...
Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson...
The relative difference between two data values is of interest in a number of application domains including temporal and spatial applications, schema versioning, data warehousing...
John F. Roddick, Kathleen Hornsby, Denise de Vries