663 search results - page 3 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
DAC
1992
ACM
13 years 11 months ago
1992
ACM
AMAI
1999
Springer
13 years 7 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...