4894 search results - page 573 / 979 » The Guarding Problem - Complexity and Approximation |
121
click to vote
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...
120
click to vote
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...
124
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...
129
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...
161
click to vote
CCCG
2003
15 years 6 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...