Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentati...
In factorization approaches to nonrigid structure from
motion, the 3D shape of a deforming object is usually modeled
as a linear combination of a small number of basis
shapes. T...
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...