According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
Given n ≥ 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the ot...
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...