4894 search results - page 294 / 979 » The Guarding Problem - Complexity and Approximation |
191
click to vote
SIAMSC
2008
15 years 6 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
189
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
153
click to vote
MOR
2010
15 years 5 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
213
click to vote
JMLR
2010
15 years 1 months ago
2010
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
188
click to vote
PAMI
2012
13 years 9 months ago
2012
—We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a stateof-the-art approach, our method offers more than an order of magn...