Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
Categorizing web-based videos is an important yet challenging task. The difficulties arise from large data diversity within a category, lack of labeled data, and degradation of vi...
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Br...
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...