Results 291 to 300 of about 7,122,799 (334)
Some of the next articles are maybe not open access.
Online Portfolio Selection, 2018
X Y X Y Y X Y X Y X X String S = X Y X X Y X Y X Y Y
semanticscholar +4 more sources
X Y X Y Y X Y X Y X X String S = X Y X X Y X Y X Y Y
semanticscholar +4 more sources
GenieHD: Efficient DNA Pattern Matching Accelerator Using Hyperdimensional Computing
Design, Automation and Test in Europe, 2020DNA pattern matching is widely applied in many bioinformatics applications. The increasing volume of the DNA data exacerbates the runtime and power consumption to discover DNA patterns.
Yeseong Kim +3 more
semanticscholar +1 more source
In‐Memory Computing with Memristor Content Addressable Memories for Pattern Matching
Advances in Materials, 2020The dramatic rise of data‐intensive workloads has revived application‐specific computational hardware for continuing speed and power improvements, frequently achieved by limiting data movement and implementing “in‐memory computation”.
Catherine E. Graves +6 more
semanticscholar +1 more source
SIAM Journal on Computing, 1992
Summary: Pattern matching is an important operation used in many applications such as functional programming, rewriting, and rule-based expert systems. By preprocessing the pattern into a deterministic finite state automaton, we can rapidly select the matching pattern(s) in a single scan of the relevant portions of the input term.
Sekar, R. C. +2 more
openaire +2 more sources
Summary: Pattern matching is an important operation used in many applications such as functional programming, rewriting, and rule-based expert systems. By preprocessing the pattern into a deterministic finite state automaton, we can rapidly select the matching pattern(s) in a single scan of the relevant portions of the input term.
Sekar, R. C. +2 more
openaire +2 more sources
Games and Economic Behavior, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lambson, Val E., Probst, Daniel A.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lambson, Val E., Probst, Daniel A.
openaire +2 more sources
IEEE Transactions on Smart Grid, 2018
Most current customer baseline load (CBL) estimation methods for incentive-based demand response (DR) rely heavily on historical data and are unable to adapt to the cases when the load patterns (LPs) in the DR event day are not similar enough to those in
Fei Wang +5 more
semanticscholar +1 more source
Most current customer baseline load (CBL) estimation methods for incentive-based demand response (DR) rely heavily on historical data and are unable to adapt to the cases when the load patterns (LPs) in the DR event day are not similar enough to those in
Fei Wang +5 more
semanticscholar +1 more source
Journal of Applied Statistics, 2004
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques,
openaire +1 more source
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques,
openaire +1 more source
Proceedings 38th Annual Symposium on Foundations of Computer Science, 2000
Summary: Let a text string \(T\) of \(n\) symbols and a pattern string \(P\) of \(m\) symbols from alphabet \(\Sigma\) be given. A swapped version \(T'\) of \(T\) is a length \(n\) string derived from \(T\) by a series of local swaps (i.e., \(t_\ell'\leftarrow t_{\ell+1}\) and \(t_{\ell+1}'\leftarrow t_\ell\)), where each element can participate in no ...
Amir, Amihood +4 more
openaire +2 more sources
Summary: Let a text string \(T\) of \(n\) symbols and a pattern string \(P\) of \(m\) symbols from alphabet \(\Sigma\) be given. A swapped version \(T'\) of \(T\) is a length \(n\) string derived from \(T\) by a series of local swaps (i.e., \(t_\ell'\leftarrow t_{\ell+1}\) and \(t_{\ell+1}'\leftarrow t_\ell\)), where each element can participate in no ...
Amir, Amihood +4 more
openaire +2 more sources
Fast Pattern Matching in Strings
SIAM journal on computing (Print), 1977D. Knuth, James H. Morris, V. Pratt
semanticscholar +1 more source