Sciweavers

662 search results - page 117 / 133
» Trees, Automata and XML
Sort
View
CIKM
2008
Springer
15 years 1 months ago
Structural relevance: a common basis for the evaluation of structured document retrieval
This paper presents a unified framework for the evaluation of a range of structured document retrieval (SDR) approaches and tasks. The framework is based on a model of tree retrie...
Mir Sadek Ali, Mariano P. Consens, Gabriella Kazai...
ER
2008
Springer
108views Database» more  ER 2008»
15 years 1 months ago
Automatic Extraction of Structurally Coherent Mini-Taxonomies
In this paper we demonstrate an automatic approach for emergent semantics modeling of ontologies. We follow the collaborative ontology construction method without the direct intera...
Khalid Saleem, Zohra Bellahsene
PVLDB
2008
128views more  PVLDB 2008»
14 years 11 months ago
Implementing filesystems by tree-aware DBMSs
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
Alexander Holupirek, Marc H. Scholl
LICS
2008
IEEE
15 years 6 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
ITA
2007
153views Communications» more  ITA 2007»
14 years 11 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...