Sciweavers

12836 search results - page 295 / 2568
» Generalization Methods in Bioinformatics
Sort
View
ICSEA
2009
IEEE
15 years 2 months ago
Integrating Formal Methods with Model-Driven Engineering
In this paper, we present our position and experience on integrating formal methods with the Model-driven Engineering (MDE) approach to software development. Both these two approa...
Angelo Gargantini, Elvinia Riccobene, Patrizia Sca...
ICML
2006
IEEE
16 years 5 months ago
Kernelizing the output of tree-based methods
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
SCALESPACE
2009
Springer
15 years 11 months ago
On Level-Set Type Methods for Recovering Piecewise Constant Solutions of Ill-Posed Problems
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...
Adriano DeCezaro, Antonio Leitão, Xue-Cheng...
SIGIR
2009
ACM
15 years 11 months ago
Reciprocal rank fusion outperforms condorcet and individual rank learning methods
Reciprocal Rank Fusion (RRF), a simple method for combining the document rankings from multiple IR systems, consistently yields better results than any individual system, and bett...
Gordon V. Cormack, Charles L. A. Clarke, Stefan B&...
LICS
2007
IEEE
15 years 11 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis