3894 search results - page 24 / 779 » Approximation Algorithms for Biclustering Problems |
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
109
click to vote
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
ENTCS
2008
14 years 12 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
122
click to vote
ALGOSENSORS
2009
Springer
15 years 6 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
165
click to vote
SIAMSC
2011
14 years 6 months ago
2011
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...