3894 search results - page 103 / 779 » Approximation Algorithms for Biclustering Problems |
167
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
234
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
145
click to vote
MOC
2000
15 years 6 months ago
2000
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...
179
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
139
click to vote
ESA
2009
Springer
16 years 28 days ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...