Results 31 to 40 of about 35,772 (302)

String matching with lookahead

Discrete Applied Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peltola, Hannu, Tarhio, Jorma
openaire   +4 more sources

Privacy-Preserving Protocols for String Matching [PDF]

, 2010
String matching is a basic problem of string operation, and privacy-preserving string matching, as a special case of secure multi-party computation, has broad applications in auction, bidding and some other commercial areas. In this paper, some protocols
Zhang, Caiyun, Zhang, Ji, Yonglong Luo, Caiyun Zhang, Luo, Yonglong, Shi, Lei, Lei Shi, Ji Zhang   +7 more
core   +1 more source

A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol. [PDF]

PLoS ONE, 2017
In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can
Ping Zeng, Qingping Tan, Xiankai Meng, Zeming Shao, Qinzheng Xie, Ying Yan, Wei Cao, Jianjun Xu   +7 more
doaj   +1 more source

String matching enhancement for snort IDS [PDF]

, 2010
Intrusion Detection System (IDS) is a security technology that attempts to identify intrusions. Snort is an open source IDS which enables us to detect the previously known intrusions.
Ali Hamid, Z. Falah, S. O. Al-Mamory, A. Abdul-Razak   +3 more
core   +1 more source

Efficient systolic string matching [PDF]

, 1990
Two new string matching heuristics are presented which reduce the hardware requirement and improve the computation speed of the systolic string matcher due to Lipton and Lopresti (see 1st International Workshop on Systolic Arrays, Oxford, p.181-91, Adam ...
Megson, G.M., Bland, I.M.
core   +1 more source

Linear time algorithms for finding and representing all the tandem repeats in a string [PDF]

, 2004
Gusfield D, Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of computer and system sciences. 2004;69(4):525-546.A tandem repeat (or square) is a string [alpha][alpha], where [alpha] is a non-empty ...
Stoye, Jens, Stoye, Jens ; https://orcid.org/, Gusfield, Dan   +2 more
core   +2 more sources

PARALLEL PROCESSING OUTCOMES OF E-ABDULRAZZAQ ALGORITHM USING MULTI-CORE TECHNIQUE

Iraqi Journal for Computers and Informatics, 2022
The string matching problem is considered one of the substantial problems in the fields of computer science like speech and pattern recognition, signal and image processing, and artificial intelligence (AI).
Atheer Akram AbdulRazzaq, Nur’Aini Abdul Rashid   +1 more
doaj   +1 more source

Real-time motion data annotation via action string [PDF]

, 2014
Even though there is an explosive growth of motion capture data, there is still a lack of efficient and reliable methods to automatically annotate all the motions in a database.
Qi, T., Zhuang, Y., Zhang, Jian J., Feng, Yinfu, Xiao, J., Zhang, H., Yang, Xiaosong   +6 more
core   +1 more source

On the Complexity of String Matching for Graphs

ACM Transactions on Algorithms, 2023
Exact string matching in labeled graphs is the problem of searching paths of a graph G=(V, E) such that the concatenation of their node labels is equal to a given pattern string P [1. m ].
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi   +3 more
openaire   +3 more sources

Compressed indexes for approximate string matching [PDF]

, 2010
We revisit the problem of indexing a string S[1..n] to support finding all substrings in S that match a given pattern P[1..m] with at most k errors. Previous solutions either require an index of size exponential in k or need Ω(m k ) time for searching ...
Lam, T.-W., Chan, HL, Chan, H.-L., Lam, TW, Tam, SL, Wong, SS, Tam, S.-L., Sung, WK, Sung, W.-K., Wong, S.-S.   +9 more
core   +1 more source