2681 search results - page 55 / 537 » Problem F |
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
IJCAI
2003
13 years 10 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
DOCENG
2008
ACM
13 years 10 months ago
2008
ACM
Digital Libraries are complex information systems that involve rich sets of digital objects and their respective metadata, along with multiple organizational structures and servic...
ECCV
2008
Springer
13 years 10 months ago
2008
Springer
We analyze the problem of reconstructing a 2D function that approximates a set of desired gradients and a data term. The combined data and gradient terms enable operations like mod...