436 search results - page 22 / 88 » Recursion and Complexity |
DLT
2008
15 years 1 months ago
2008
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
102
click to vote
NIPS
2008
15 years 1 months ago
2008
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
CICLING
2010
Springer
15 years 4 months ago
2010
Springer
We introduce an Information Extraction (IE) system which uses the logical theory of an ontology as a generalisation of the typical information extraction patterns to extract biolog...
103
click to vote
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
130
click to vote
CIE
2007
Springer
15 years 3 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...