5378 search results - page 1005 / 1076 » Base Logics in Argumentation |
IFIP
2009
Springer
13 years 6 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
BIBM
2010
IEEE
13 years 6 months ago
2010
IEEE
This study presents a novel computational approach to identifying a smoking-associated gene signature. The methodology contains the following steps: 1) identifying genes significa...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Our work concerns the elucidation of the cancer (epi)genome, transcriptome and proteome to better understand the complex interplay between a cancer cell's molecular state and ...
ENTCS
2011
13 years 3 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
JCT
2011
13 years 3 months ago
2011
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...