Results 21 to 30 of about 1,296,078 (273)
String Matching: Communication, Circuits, and Learning [PDF]
, 2019 String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on
+3 more
core +2 more sources
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication
International Colloquium on Automata, Languages and Programming, 2019 An elastic-degenerate (ED) string is a sequence of $n$ sets of strings of total length $N$, which was recently proposed to model a set of similar sequences. The ED string matching (EDSM) problem is to find all occurrences of a pattern of length $m$ in an
G. Bernardini +4 more
semanticscholar +1 more source
Particle Creation If a Cosmic String Snaps [PDF]
, 1994 We calculate the Bogolubov coefficients for a metric which describes the snapping of a cosmic string. If we insist on a matching condition for all times {\it and} a particle interpretation, we find no particle creation.Comment: 10 pages, MRC.PH.17 ...
A. H. Bilge +17 more
core +3 more sources
String Matching with Multicore CPUs: Performing Better with the Aho-Corasick Algorithm
, 2014 Multiple string matching is known as locating all the occurrences of a given number of patterns in an arbitrary string. It is used in bio-computing applications where the algorithms are commonly used for retrieval of information such as sequence analysis
Arudchutha, S. +2 more
core +1 more source
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, 2005 Calculational developments of functional programs have been likened to conjuring tricks: enjoyable to watch but often a mystery as to how they are done. This pearl explains the trick. The aim is to give new calculations of two famous algorithms in string matching, the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm.
openaire +1 more source
Dictionary matching in a stream [PDF]
, 2015 We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream. We present a
A.V. Aho +10 more
core +5 more sources
Improved Parallel Rabin-Karp Algorithm Using Compute Unified Device Architecture
, 2018 String matching algorithms are among one of the most widely used algorithms in computer science. Traditional string matching algorithms efficiency of underlaying string matching algorithm will greatly increase the efficiency of any application. In recent
D Xu +6 more
core +1 more source
On-line construction of position heaps [PDF]
, 2011 We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it considers the ...
A. Blumer +10 more
core +8 more sources
Optimal Packed String Matching [PDF]
, 2011 In the packed string matching problem, each machine word accommodates α characters, thus an n-character text occupies n/α memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/α) time and ...
Ben-Kiki, Oren +5 more
core +3 more sources
On the YM and QCD spectra from five dimensional strings
, 2009 We consider a non-critical five dimensional string setup which could provide a dual description of QCD in the limit of large number of colors and flavors.
ALDO L. COTRONE +15 more
core +1 more source