Sciweavers

3545 search results - page 259 / 709
» Computational methods for case-cohort studies
Sort
View
JMLR
2006
145views more  JMLR 2006»
15 years 6 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
SIAMJO
2008
86views more  SIAMJO 2008»
15 years 6 months ago
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
Alexandre Belloni, Robert M. Freund
SEMWEB
2007
Springer
16 years 24 days ago
Analyzing Mapping Extraction Approaches
While lots of research in ontology matching is related to the issue of computing and refining similarity measures, only little attention has been paid to question how to extract t...
Christian Meilicke, Heiner Stuckenschmidt
COMPLIFE
2005
Springer
16 years 6 days ago
Fast and Accurate Structural RNA Alignment by Progressive Lagrangian Optimization
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignmen...
Markus Bauer, Gunnar W. Klau, Knut Reinert
173
Voted
BMCBI
2006
141views more  BMCBI 2006»
15 years 6 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...