4843 search results - page 562 / 969 » The Shortcut Problem - Complexity and Approximation |
124
Voted
NIPS
2007
15 years 6 months ago
2007
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
125
Voted
NIPS
2007
15 years 6 months ago
2007
We introduce supervised latent Dirichlet allocation (sLDA), a statistical model of labelled documents. The model accommodates a variety of response types. We derive a maximum-like...
128
click to vote
PDPTA
2007
15 years 6 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
155
Voted
CATS
2006
15 years 6 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
130
click to vote
FLAIRS
2006
15 years 6 months ago
2006
We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDP...