We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectan...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
An eddy [2] is a highly adaptive query processing operator that continuously reoptimizes a query in response to changing runtime conditions. It does this by treating query process...
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...