This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
In supplement to an earlier paper, we present an altered cost functional for the computation of an edge-preserving optical flow that is invariant to rotation. In addition, we expl...
Christopher V. Alvino, Allen Tannenbaum, Anthony J...
We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation al...
Abdol-Reza Mansouri, Thierry Chomaud, Janusz Konra...