Sciweavers

2542 search results - page 95 / 509
» One step ahead
Sort
View
ICML
2003
IEEE
14 years 10 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
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...
Martin Zinkevich
RECOMB
2005
Springer
14 years 9 months ago
A Framework for Orthology Assignment from Gene Rearrangement Data
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...
SIGMOD
2006
ACM
112views Database» more  SIGMOD 2006»
14 years 9 months ago
Join minimization in XML-to-SQL translation: an algebraic approach
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 ...
BCI
2009
IEEE
14 years 4 months ago
On the Performance of SVD-Based Algorithms for Collaborative Filtering
—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...
IEEEARES
2008
IEEE
14 years 3 months ago
Matching Policies with Security Claims of Mobile Applications
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...