4843 search results - page 609 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
153
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
148
click to vote
AAAI
2010
15 years 6 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
140
click to vote
AAAI
2010
15 years 6 months ago
2010
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
121
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...