Digital libraries (DLs) are complex information systems and therefore demand formal
foundations lest development efforts diverge and interoperability suffers. In this article, we …

The widespread adoption of XML holds out the promise that document structure can be
exploited to specify precise database queries. However, the user may have only a limited …

We describe an approach to retrieval of documents that contain of both free text and
semantically enriched markup. In particular, we present the design and implementation …

Querying XML data is a well-explored topic with powerful database-style query languages
such as XPath and XQuery set to become W3C standards. An equally compelling paradigm …

Tree patterns are fundamental to querying tree-structured data like XML. Because of the
heterogeneity of XML data, it is often more appropriate to permit approximate query …

Exemplar-based inpainting algorithm is a new model used for large region removal. It
combines the advantages of both inpainting and texture synthesis. The crucial part of this …

Query languages for XML such as XPath or XQuery support Boolean retrieval: a query result
is a (possibly restructured) subset of XML elements or entire documents that satisfy the …

XML repositories are usually queried both on structure and content. Due to structural
heterogeneity of XML, queries are often interpreted approximately and their answers are …

One vision of the Semantic Web is that it will be much like the Web we know today, except
that documents will be enriched by annotations in machine understandable markup. These …

XML represents both content and structure of documents. Taking advantage of the document
structure promises to greatly improve the retrieval precision. In this article, we present a …