The statistical perspective on boosting algorithms focuses on optimization, drawing parallels with maximum likelihood estimation for logistic regression. In this paper we present ...
This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly -filtered Boolean algebras. We show that for ...
In 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2, . . . , vn; label t...
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...