7930 search results - page 284 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
AAIM
2008
Springer
15 years 8 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
176
click to vote
JMLR
2010
15 years 1 months ago
2010
Variational Bayesian (VB) methods are typically only applied to models in the conjugate-exponential family using the variational Bayesian expectation maximisation (VB EM) algorith...
174
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
172
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
165
click to vote
IPL
2008
15 years 6 months ago
2008
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...