666 search results - page 45 / 134 » The Pipelined Set Cover Problem |
111
click to vote
ECCC
2006
15 years 3 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 , ,
135
click to vote
COMPGEOM
2009
ACM
15 years 9 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...
155
click to vote
PODS
2003
ACM
16 years 3 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...
161
click to vote
CVPR
2008
IEEE
15 years 9 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...
107
click to vote
AAAI
2008
15 years 5 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...