In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...