269 search results - page 4 / 54 » Complexity Theory Made Easy |
IWIA
2006
IEEE
14 years 2 months ago
2006
IEEE
Zero-day attacks, new (anomalous) attacks exploiting previously unknown system vulnerabilities, are a serious threat. Defending against them is no easy task, however. Having ident...
DFG
1992
Springer
14 years 23 days ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
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ā...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
ā For many applications, the control of a complex nonlinear system can be made easier by modeling the system as a collection of simpliļ¬ed hybrid modes, each representing a part...
GBRPR
2009
Springer
13 years 6 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...