3894 search results - page 431 / 779 » Approximation Algorithms for Biclustering Problems |
141
click to vote
DAM
2007
15 years 4 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
139
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
133
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
135
click to vote
TKDE
2008
15 years 4 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
130
click to vote
ATMOS
2010
15 years 3 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...