Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...
Learning typical motion patterns or activities from videos of crowded scenes is an important visual surveillance problem. To detect typical motion patterns in crowded scenarios, w...
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...