15033 search results - page 184 / 3007 » Complexity Theory and Algorithms |
205
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
212
click to vote
LPNMR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
241
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
205
Voted
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
170
Voted
CGF
2000
15 years 6 months ago
2000
: Having evolved from volume visualisation, volume graphics is emerging as an important sub-field of computer graphics. This paper focuses on a fundamental aspect of volume graphic...