11345 search results - page 1589 / 2269 » Foundations of Computer Science |
202
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
169
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
154
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
195
click to vote
CCGRID
2006
IEEE
16 years 1 months ago
2006
IEEE
Provenance is generally defined as the documentation of a process that leads to some result, and has long been recognised as being fundamental to the development of problem solvi...
199
click to vote
HICSS
2006
IEEE
16 years 1 months ago
2006
IEEE
Honeypots are computer systems that try to fool cyberattackers into thinking they are ordinary computer systems, when in fact they are designed solely to collect data about attack...