We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
This paper introduces a study about managing the performance of virtual teams using intelligent agents. Through a review of previous research, the paper starts by contextually sit...
This paper explores the possibility of a linear model as a solution to the problem of appearance-based pose estimation. The parametric eigenspace method (or its extensions that ar...
Abstract. Controlling concurrent systems to impose some global invariant is an undecidable problem. One can gain decidability at the expense of reducing concurrency. Even under thi...
Saddek Bensalem, Marius Bozga, Susanne Graf, Doron...
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...