578 search results - page 41 / 116 » The Minimum-Entropy Set Cover Problem |
ACSD
2009
IEEE
14 years 1 months ago
2009
IEEE
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...
ECCC
2006
13 years 8 months ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
PODS
2003
ACM
14 years 9 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
CVPR
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoin...