—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
The representation of moving geometry entities is an important issue in the fields of CAD/CAM and robotics motion design. We present a method to interpolate the moving frame homog...
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...