Concept
String-searching algorithm
Related publications (48)
In Medio Stat Virtus: Combining Boolean and Pattern Matching
Giovanni De Micheli, Alessandro Tempia Calvino, Gianluca Radi
Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...
2024List Ordered Statistics Decoders for Polar Codes
Andreas Peter Burg, Yifei Shen, Chuan Zhang
The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...
IEEE2022An Analysis of Super-Net Heuristics in Weight-Sharing NAS
Weight sharing promises to make neural architecture search (NAS) tractable even on commodity hardware. Existing methods in this space rely on a diverse set of heuristics to design and train the shared-weight backbone network, a.k.a. the super-net. Since he ...
IEEE COMPUTER SOC2022Matchertext: Towards Verbatim Interlanguage Embedding
Embedding text in one language within text of another is commonplace for numerous purposes, but usually requires tedious and error-prone “escaping” transformations on the embedded string. We propose a simple cross-language syntactic discipline, matchertext ...
2022Matching Seqlets: An Unsupervised Approach for Locality Preserving Sequence Matching
In this paper, we propose a novel unsupervised approach for sequence matching by explicitly accounting for the locality properties in the sequences. In contrast to conventional approaches that rely on frame-to-frame matching, we conduct matching using sequ ...
IEEE COMPUTER SOC2021Probabilistic Symbol Sequence Matching and its Application to Pathological Speech Intelligibility Assessment
Matching of a test signal to a reference word hypothesis forms the core of many speech processing problems, including objective speech intelligibility assessment. This paper first shows that the comparison of two speech signals can be formulated as matchin ...
Idiap2021Asymptotic decoupling and weak Gibbs measures for finite alphabet shift spaces
For the spaceXin a large class of finite alphabet shift spaces (lattice models) and the class of functionsfwith bounded total oscillations, we prove that each equilibrium measure nu atf=phi is a weak Gibbs measures for phi-P(phi). In addition, the empirica ...
2020A Mechanized Theory of Quoted Code Patterns
The pattern matching on code from the new macro system of Scala 3 is modeled by a calculus called λ half-circle. We present a mechanized proof of soundness of the calculus in Coq and discuss encountered challenges. ...
2020