16404 search results - page 212 / 3281 » A set coverage problem |
118
Voted
SPLC
2008
15 years 5 months ago
2008
Scalability is recognized as a key challenge in the automated analysis of Feature Models (FMs). Current solutions in this context mainly propose using different logic paradigms as...
148
Voted
ECCC
2010
15 years 3 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
112
Voted
IJCGA
2007
15 years 3 months ago
2007
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
129
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
94
Voted
BMVC
2010
15 years 1 months ago
2010
Linear subspace representations of appearance variation are pervasive in computer vision. In this paper we address the problem of robustly matching them (computing the similarity ...