4894 search results - page 84 / 979 » The Guarding Problem - Complexity and Approximation |
131
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
91
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
101
click to vote
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
123
Voted
AMC
2005
15 years 2 months ago
2005
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
110
Voted
MOC
2000
15 years 2 months ago
2000
Abstract. Finite element approximations for the Dirichlet problem associated to a second