The static determination of approximated values of string expressions has many potential applications. For instance, approximated string values may be used to check the validity an...
Tae-Hyoung Choi, Oukseh Lee, Hyunha Kim, Kyung-Goo...
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...