1071 search results - page 13 / 215 » Theories of Automatic Structures and Their Complexity |
3DPH
2009
14 years 7 months ago
2009
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
SEFM
2006
IEEE
15 years 3 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
76
Voted
LREC
2008
14 years 11 months ago
2008
This paper describes a study of the levels at which different rhetorical relations occur in rhetorical structure trees. In a previous empirical study (Williams and Reiter, 2003) o...
AGP
1999
IEEE
15 years 1 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...
COCO
2001
Springer
15 years 2 months ago
2001
Springer
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...