Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information ...
Seyed Reza Mirghaderi, Alireza Bayesteh, Amir K. K...
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...