Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Abstract. Gene rearrangements have been used successfully in phylogenetic reconstruction and comparative genomics, but usually under the assumption that all genomes have the same g...
Krister M. Swenson, Nicholas D. Pattengale, Bernar...
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
Murali Mani, Song Wang, Daniel J. Dougherty, Elke ...
—In this paper, we describe and compare three Collaborative Filtering (CF) algorithms aiming at the low-rank approximation of the user-item ratings matrix. The algorithm implemen...
Manolis G. Vozalis, Angelos I. Markos, Konstantino...
The Security-by-Contract (S×C) framework has been recently proposed to address the trust relationship problem of the current security model adopted for mobile devices. The key id...
Nataliia Bielova, Marco Dalla Torre, Nicola Dragon...