Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
We present a novel approach to simultaneously reconstruct the 3D structure of a non-rigid coronary tree and estimate point correspondences between an input X-ray image and a refer...
Eduard Serradell (Institut de Robotica i Informati...
In this paper we tackle the main problem presented by the majority of Information Visualization techniques, that is, the limited number of data items that can be visualized simulta...
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...