7289 search results - page 312 / 1458 » A Dependent Set Theory |
153
click to vote
COCO
2001
Springer
15 years 11 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...
164
click to vote
NAACL
2004
15 years 8 months ago
2004
We propose a theory that gives formal semantics to word-level alignments defined over parallel corpora. We use our theory to introduce a linear algorithm that can be used to deriv...
153
click to vote
AMC
2006
15 years 6 months ago
2006
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
224
click to vote
LOGCOM
2008
15 years 6 months ago
2008
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...
168
click to vote
DC
2000
15 years 6 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...