The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
In this paper, we propose a novel algorithm to discover the topk covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets...
Gao Cong, Kian-Lee Tan, Anthony K. H. Tung, Xin Xu
In this paper we propose an automatic updating system for urban vector maps that is able to detect changes between the old dataset (consisting of both vector and raster maps) and t...
S. Ceresola, Andrea Fusiello, Manuele Bicego, Albe...