685 search results - page 7 / 137 » Closure Operators for Order Structures |
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
118
Voted
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
89
Voted
AML
2008
14 years 10 months ago
2008
Abstract. This paper develops the model theory of ordered structures that satisfy Keisler's regularity scheme, and its strengthening REF(L) (the reflection scheme) which is an...
113
click to vote
CSR
2007
Springer
15 years 5 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
78
Voted
FGCS
2000
14 years 11 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...