Results 31 to 40 of about 18,990 (308)
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms.
Abdul Fadlil +2 more
doaj +1 more source
Ultra-high throughput string matching for deep packet inspection [PDF]
, 2010 Deep Packet Inspection (DPI) involves searching a packet's header and payload against thousands of rules to detect possible attacks. The increase in Internet usage and growing number of attacks which must be searched for has meant hardware acceleration ...
Wang, Xiaojun +7 more
core +1 more source
Compressibility-Aware Quantum Algorithms on Strings [PDF]
, 2023 Sublinear time quantum algorithms have been established for many fundamental problems on strings. This work demonstrates that new, faster quantum algorithms can be designed when the string is highly compressible. We focus on two popular and theoretically
Gibney, Daniel, Thankachan, Sharma V.
core +1 more source
Consistent Unsupervised Estimators for Anchored PCFGs
Transactions of the Association for Computational Linguistics, 2020 Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning ( 1969 ). Here we present an algorithm based on distributional learning that is a consistent estimator for a large class of ...
Clark, Alexander, Fijalkow, Nathanaël
doaj +1 more source
Adaptive text mining: Inferring structure from sequences [PDF]
, 2004 Text mining is about inferring structure from sequences representing natural language text, and may be defined as the process of analyzing text to extract information that is useful for particular purposes.
Witten, Ian H.
core +1 more source
Rotation of bits: a classical and quantum perspective
Journal of Electrical Systems and Information Technology, 2021 Bit rotation is an operation similar to shift except that the bits that fall off at one end are put back to the other end. In left rotation, the bits that fall off at left end are put back at right end.
Peter Nimbe +2 more
doaj +1 more source
Small Longest Tandem Scattered Subsequences
Scientific Annals of Computer Science, 2021 We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.
Luıs M. S. Russo +1 more
doaj +1 more source
Hide and Mine in Strings: Hardness and Algorithms [PDF]
2020 IEEE International Conference on Data Mining (ICDM), 2020 We initiate a study on the fundamental relation between data sanitization (i.e., the process of hiding confidential information in a given dataset) and frequent pattern mining, in the context of sequential (string) data. Current methods for string sanitization hide confidential patterns introducing, however, a number of spurious patterns that may harm ...
G. Bernardini (Giulia) +9 more
openaire +5 more sources
Hardness of Detecting Abelian and Additive Square Factors in Strings [PDF]
, 2021 We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in a string.
Radoszewski, Jakub +4 more
core +1 more source
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source