740 search results - page 75 / 148 » An approximation ratio for biclustering |
STOC
2007
ACM
16 years 6 days ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
ICMCS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper introduces a ¢¤£ discrete, non-separable transform for image processing, which can be regarded as a combination of the well known Discrete Cosine Transform (DCT) wit...
108
click to vote
AAIM
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...