We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear wheth...
James H. Andrews, Alex Groce, Melissa Weston, Ru-G...
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...
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Learning from data streams is a research area of increasing importance. Nowadays, several stream learning algorithms have been developed. Most of them learn decision models that c...