We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
During the past few years, several studies have been made on the performance of real-time database systems with respect to the number of transactions that miss their deadlines. Th...
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have...