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...
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...
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ā...
ā 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...
Jeremy H. Gillula, Haomiao Huang, Michael P. Vitus...
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...