The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
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 ...
In this paper a detail analysis of speech coding algorithm based on forward adaptive technique is carried out. We consider an algorithm that works on frame-by-frame basis, where a ...
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...