We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...