Sciweavers

278 search results - page 51 / 56
» Searching XML documents via XML fragments
Sort
View
LICS
2005
IEEE
14 years 3 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 7 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
LICS
2010
IEEE
13 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
JCDL
2009
ACM
127views Education» more  JCDL 2009»
14 years 4 months ago
Collecting fragmentary authors in a digital library
This paper discusses new work to represent, in a digital library of classical sources, authors whose works themselves are lost and who survive only where surviving authors quote, ...
Monica Berti, Matteo Romanello, Alison Babeu, Greg...
ICML
2007
IEEE
14 years 10 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda