Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
The problem of maximizing a concave function f (x) in the unit simplex Δ can be solved approximately by a simple greedy algorithm. For given κ, the algorithm can find a point x(κ) on a κ-dimensional face of Δ, such that f (x(κ)) ≥ f (x*) - O(1/κ). Here f (x*) is the maximum value of f in A, and the constant factor depends on f. This algorithm and analysis were known before, and related to problems of statistics and machine learning, such as boosting, regression, and density mixture estimation. In other work, coming from computational geometry, the existence of e-coresets was shown for the minimum enclosing ball problem by means of a simple greedy algorithm. Similar greedy algorithms, which are special cases of the Frank-Wolfe algorithm, were described for other enclosure problems. Here these results are tied together, stronger convergence results are reviewed, and several coreset bounds are generalized or strengthened. ©2010 ACM 1549-6325/2010/08-ART63 $10.00.
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Minghong Fang, Zifan Zhang, et al.
CCS 2024