Sciweavers

432 search results - page 22 / 87
» On Notions of Regularity for Data Languages
Sort
View
CSR
2008
Springer
13 years 9 months ago
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
Nutan Limaye, Meena Mahajan, Antoine Meyer
PLDI
2010
ACM
14 years 5 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
ICML
2006
IEEE
14 years 8 months ago
Ranking on graph data
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
Shivani Agarwal
DOOD
1993
Springer
135views Database» more  DOOD 1993»
13 years 11 months ago
A Deductive and Typed Object-Oriented Language
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
René Bal, Herman Balsters
PPSWR
2004
Springer
14 years 29 days ago
Towards a Multi-calendar Temporal Type System for (Semantic) Web Query Languages
Abstract. Time is omnipresent on the (Semantic) Web. However, formalism like XML, XML Schema, RDF, OWL and (Semantic) Web query languages have, if any, only very limited notions of...
François Bry, Stephanie Spranger