2430 search results - page 197 / 486 » Computing Tutte Polynomials |
159
click to vote
KI
2007
Springer
15 years 10 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...
137
Voted
ISBI
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper, we present a robust, hierarchical Partition of Unity Finite Element Method (PUFEM) to compute the transformation between two images, which is represented by a non-r...
148
Voted
WWW
2005
ACM
16 years 5 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
252
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
124
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...