This paper quantifies the approximation error in Clark’s approach [1] to computing the maximum (max) of Gaussian random variables; a fundamental operation in statistical timing...
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
Vincent C. Hu, D. Richard Kuhn, David F. Ferraiolo
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...