We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
For the last few years a considerable number of efforts have been devoted into integrating security issues into information systems development practices. This has led to a number...
This letter addresses the problem of joint estimation of carrier frequency offset (CFO) and channel for OFDM systems in the presence of timing ambiguity. Based on two signal models...
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...