1298 search results - page 50 / 260 » The online set cover problem |
104
click to vote
PODS
2003
ACM
15 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...
108
click to vote
CVPR
2008
IEEE
15 years 4 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...
EUROCRYPT
2004
Springer
15 years 1 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
AAAI
2008
15 years 1 days 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...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...