In this paper we analyze the effectiveness of dynamic artificial diversity, i.e., artificial diversity in which the subject of the diversity is re-randomized periodically. We refer...
Anh Nguyen-Tuong, Andrew Wang, Jason Hiser, John C...
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
In this paper we present a novel dynamic verification approach to protect the local host confidentiality from malicious Java mobile code. In our approach we use Bytecode Modificat...
Dan Lu, Yoshitake Kobayashi, Ken Nakayama, Mamoru ...