A Parallel Algorithm for Binary-Tree-Based String Re-writing inthe L-System.
Tingjun YangZhengge HuangXingsheng LinJianjun ChenJun NiPublished in: IMSCCS (2007)
Keyphrases
- parallel algorithm
- hamming distance
- parallel programming
- binary strings
- parallel computation
- shared memory
- data structure
- cluster of workstations
- parallel version
- parallel implementations
- medial axis transform
- binary search trees
- graphics processors
- orders of magnitude
- pc cluster
- discovery of association rules
- multiscale