We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...