7930 search results - page 479 / 1586 » Greedy in Approximation Algorithms |
174
click to vote
MICS
2007
15 years 6 months ago
2007
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
156
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
175
click to vote
FLAIRS
2009
15 years 4 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
205
click to vote
CASES
2010
ACM
15 years 3 months ago
2010
ACM
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
218
click to vote
TNN
2010
15 years 1 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...