450 search results - page 10 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
108
click to vote
BCB
2010
14 years 6 months ago
2010
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
160
click to vote
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
113
click to vote
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
100
click to vote
WG
2004
Springer
15 years 5 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...