269 search results - page 4 / 54 » Complexity Theory Made Easy |
128
click to vote
IWIA
2006
IEEE
15 years 5 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...
131
Voted
DFG
1992
Springer
15 years 3 months 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
14 years 6 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
14 years 10 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...
100
Voted
GBRPR
2009
Springer
14 years 9 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...