Sciweavers

819 search results - page 89 / 164
» Parallelization with Tree Skeletons
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 1 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
ICDS
2007
IEEE
15 years 4 months ago
Automatic Acquisition of Translation Knowledge Using Structural Matching Between Parse Trees
— In this paper we present a rule-based formalism for the representation, acquisition, and application of translation knowledge. The formalism is being used successfully in a Jap...
Werner Winiwarter
ISPDC
2006
IEEE
15 years 3 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
ICPADS
2005
IEEE
15 years 3 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
EUROMICRO
1999
IEEE
15 years 2 months ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen