Sciweavers

915 search results - page 3 / 183
» Proof labeling schemes
Sort
View
RTA
2010
Springer
13 years 10 months ago
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
Takahito Aoto
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 8 months ago
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
Xiaodong Wu, Mong-Li Lee, Wynne Hsu
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 15 days ago
Average Case Analysis for Tree Labelling Schemes
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
XSYM
2010
Springer
172views Database» more  XSYM 2010»
13 years 5 months ago
EBSL: Supporting Deleted Node Label Reuse in XML
Recently, there has been much research into the specification of dynamic labeling schemes supporting XML updates. The primary design goal of any dynamic labeling scheme is to limi...
Martin F. O'Connor, Mark Roantree
ICALP
2007
Springer
14 years 1 months ago
Labeling Schemes for Vertex Connectivity
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
Amos Korman