Sciweavers

96 search results - page 10 / 20
» Ordering Constraints over Feature Trees
Sort
View
119
Voted
WWW
2008
ACM
16 years 1 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
211
Voted
ICDT
2010
ACM
259views Database» more  ICDT 2010»
15 years 9 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
PEPM
2011
ACM
14 years 3 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
102
Voted
EMNLP
2008
15 years 1 months ago
Sparse Multi-Scale Grammars for Discriminative Latent Variable Parsing
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...
Slav Petrov, Dan Klein
59
Voted
ECAI
2006
Springer
15 years 4 months ago
Last Conflict Based Reasoning
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priori...
Christophe Lecoutre, Lakhdar Sais, Sébastie...