<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

20131

Settings

🏛️國立陽明交通大學機構典藏

Access type: Metadata onlyAuthor: search.filters.author.Tseng, Kuo-Kun

Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item type:Item,
    Solution of Skip Distance Constraint on Sub-linear Time String-matching Architecture
    (2013)
    Huang, Nai-Lun
    ;
    Lee, Tsern-Huei
    ;
    Tseng, Kuo-Kun
    ;
    交大名義發表
    ;
    National Chiao Tung University
    Pre-filters are well-known techniques used to speed up string-matching process. The skip-based pre-filters make it possible to achieve sub-linear time complexity. However, they have a common constraint that their skip distances are bounded by the shortest keyword length. If the shortest keyword length is small, then this constraint will be a bottleneck problem in string-matching throughput. This paper provides a solution that the skip distance can be longer than the shortest keyword length. Also, a matching strategy based on the solution is proposed. This strategy can not only solve the bottleneck problem, but also reduce the operations in the sub-linear time string-matching procedure.