Titlebook: Web Technologies and Applications; 14th Asia-Pacific We Quan Z. Sheng,Guoren Wang,Guandong Xu Conference proceedings 2012 Springer-Verlag B

追踪

皱痕

凹槽

amyloid

不怕任性

捏造

神刊

Memory-Aware BWT by Segmenting Sequences to Support Subsequence Search. In this paper, we propose two query methods based on S-BWT and guarantee to find all subsequence occurrences. Our methods can not only require small memory space, but also are faster than the state-of-art BWT backward search method for long sequence.

Intact

H-Tree: A Hybrid Structure for Confidence Computation in Probabilistic Databases to small partitions which are either read-once or NP-hard. Then we propose algorithms for building H-tree and parallelizing (approximate) confidence computation. We also propose fundamental theorems to ensure the correctness of our approaches. Performance experiments demonstrate the benefits of H-t

Cervical-Spine

H-Tree: A Hybrid Structure for Confidence Computation in Probabilistic Databases to small partitions which are either read-once or NP-hard. Then we propose algorithms for building H-tree and parallelizing (approximate) confidence computation. We also propose fundamental theorems to ensure the correctness of our approaches. Performance experiments demonstrate the benefits of H-t

诱惑