16404 search results - page 627 / 3281 » A set coverage problem |
187
click to vote
DGCI
2003
Springer
16 years 10 days ago
2003
Springer
The problem of reconstructing finite subsets of the integer lattice from X-rays has been studied in discrete mathematics and applied in several fields like image processing, data...
183
click to vote
JGO
2008
15 years 7 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
188
click to vote
ISAAC
2003
Springer
16 years 9 days ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
189
click to vote
KDD
2008
ACM
16 years 7 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...
161
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...