Sciweavers

63 search results - page 5 / 13
» Computing Critical Pairs in 2-Dimensional Rewriting Systems
Sort
View
RTA
2004
Springer
14 years 1 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
CONCUR
2003
Springer
14 years 28 days ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski
IPPS
2006
IEEE
14 years 1 months ago
Design flow for optimizing performance in processor systems with on-chip coarse-grain reconfigurable logic
A design flow for processor platforms with on-chip coarse-grain reconfigurable logic is presented. The reconfigurable logic is realized by a 2-Dimensional Array of Processing Elem...
Michalis D. Galanis, Grigoris Dimitroulakos, Const...
PDPTA
1996
13 years 9 months ago
Stereo Vision and 3D Reconstruction on a Distributed Memory System
An important research topic in image processing is stereo vision. The objective is to compute a 3-dimensional representation of some scenery from two 2-dimensional digital images....
N. H. L. Kuijpers, G. Paar, Johan J. Lukkien
RTA
2009
Springer
14 years 2 months ago
VMTL-A Modular Termination Laboratory
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
Felix Schernhammer, Bernhard Gramlich