Sciweavers

231 search results - page 13 / 47
» Simulating Multigraph Transformations Using Simple Graphs
Sort
View
PEPM
2007
ACM
14 years 1 months ago
XML graphs in program analysis
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tai...
Anders Møller, Michael I. Schwartzbach
PDCAT
2007
Springer
14 years 1 months ago
A Distributed Virtual Machine for Parallel Graph Reduction
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
IJWGS
2006
125views more  IJWGS 2006»
13 years 7 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
WCNC
2010
IEEE
13 years 6 months ago
Combining Parallel Sequence Spread Spectrum (PSSS) with OFDM - Concept and Simulation Results
—In this paper, we present a novel multi-carrier spread spectrum (MCSS) system which uses Parallel Sequence Spread Spectrum (PSSS) as its spreading transform. This technique call...
Paulo Isagani M. Urriza, Joel Joseph S. Marciano J...
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 9 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas