3894 search results - page 334 / 779 » Approximation Algorithms for Biclustering Problems |
185
click to vote
JCC
2006
15 years 6 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
190
Voted
FOIKS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
184
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
131
click to vote
CDC
2008
IEEE
16 years 23 days ago
2008
IEEE
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
179
click to vote
AAAI
2006
15 years 7 months ago
2006
We discuss the problem of finding a good state representation in stochastic systems with observations. We develop a duality theory that generalizes existing work in predictive sta...