417 search results - page 3 / 84 » Running Time Predictions for Factoring Algorithms |
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
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...
KBSE
2008
IEEE
14 years 20 days ago
2008
IEEE
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...
IPL
2008
13 years 6 months ago
2008
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...
HPCA
2009
IEEE
14 years 6 months ago
2009
IEEE
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
KDD
2009
ACM
13 years 10 months ago
2009
ACM
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...