663 search results - page 10 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
ESWS
2011
Springer
12 years 11 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
KI
2007
Springer
14 years 1 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...