

...paper we describe a new parallel algorithm that performs term matching in o(log2
n) time using o(n) processors. in our algorithm, we represent the two terms...they have the same sequence of edgelabels on the path to their respective roots. this is the basis of our parallel algorithm for term matching....

...provides for the constraint graph to be partitioned and executed in parallel across several machines, for improved performance. with our system, one can...present experiments demonstrating how dlove improves performance by dramatically increasing the validity of the rendered frames. we also present performance measures to measure statistical skew in the...

...the need for efficient lattice manipulations. the processing of large datasets has often been approached with parallel algorithms
and some preliminary studies on parallel lattice construction exist in the...++ language and its practical performances have been compared to those of a homologue sequential algorithm.
...

...model checking engines
are orchestrated to reach the best possible performance on a broad and real set of designs. model checking algorithms are
evaluated through experiments, and...exploiting an onthefly performance analysis, (4) record results of different approaches,
and sort out heuristics to target different classes of problems. we provide a detailed...

...ing is a core operation performed on an xml document for it to be accessed and manipulated. this operation is known to cause performance bottlenecks in ap plications and systems that process large volumes of xml data. we believe that parallelism is a natural way to boost performance. leveragi ng multicore proces sors...

...this paper describes a dataparallel algorithm for boolean function manipulation. the algorithm adopts binary decision diagrams (bdds), which are the stateoftheart approach for representing...the approach exploits well the parallel hardware by effectively distributing the load; thanks to the limited cpu time required and to the great amount of memory available, it can solve...

...this paper describes a dataparallel algorithm for boolean function manipulation. the algorithm adopts binary decision diagrams (bdds), which are the stateoftheart approach for representing...the approach exploits well the parallel hardware by effectively distributing the load; thanks to the limited cpu time required and to the great amount of memory available, it can solve...

...dimensionality reduction provide a way to understand and visualize the underlying structure of complex data sets. the performance of largescale nonlinear dimensionality reduction is of key importance in data mining...this paper, we concentrate on improving the performance of nonlinear dimensionality reduction using large...

...the parallel complexity of various operations onsorted sets is studied. let x and y be twosorted sets of respective size n and m...erew pram. in thispaper we improve this result by showing thatthe same timeperformance is obtainable withd(m log...