Sciweavers

438 search results - page 27 / 88
» The forest hiding problem
Sort
View
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
15 years 1 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
STACS
2010
Springer
15 years 6 months ago
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
Andreas Björklund
JMLR
2010
107views more  JMLR 2010»
14 years 6 months ago
Error-Correcting Ouput Codes Library
In this paper, we present an open source Error-Correcting Output Codes (ECOC) library. The ECOC framework is a powerful tool to deal with multi-class categorization problems. This...
Sergio Escalera, Oriol Pujol, Petia Radeva
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
RECOMB
2010
Springer
14 years 10 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...