Sciweavers

108 search results - page 4 / 22
» Hybrid Transitive Closure Algorithms
Sort
View
COCOA
2009
Springer
15 years 1 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
71
Voted
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
15 years 4 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 1 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
70
Voted
TVLSI
2002
161views more  TVLSI 2002»
14 years 9 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
JEA
2006
83views more  JEA 2006»
14 years 9 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna