Results 271 to 280 of about 319,166 (311)
Some of the next articles are maybe not open access.
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 ...
Amihood Amir +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 ...
Amihood Amir +4 more
openaire +2 more sources
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.
R. C. Sekar 0001 +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.
R. C. Sekar 0001 +2 more
openaire +2 more sources
Juggling with Pattern Matching
Theory of Computing Systems, 2006In the late 1980s it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by many mathematicians and computer scientists. In this paper we propose to study juggling patterns from a pattern matching point of view.
Jean Cardinal +2 more
openaire +3 more sources
Algorithms for pattern matching
Software: Practice and Experience, 1986AbstractThis paper describes four algorithms of varying complexity used for pattern matching, and investigates their behaviour. The algorithms are tested using patterns of varying length from several alphabets. It is concluded that although there is no overall ‘best’ algorithm, the more complex algorithms are worth considering as they are generally ...
G. Davies, S. Bowsher
openaire +1 more source
Pattern matching and call by pattern
1975The paper describes SNARK, a new pattern matching language which was specifically designed with the aim of extending programming languages with a new and effective control mechanism (pattern directed procedure call). SNARK features a powerful and extensible pattern language and an efficient pattern retrieval mechanism.
Giorgio Levi, Franco Sirovich
openaire +1 more source
Pattern matching for permutations
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose +2 more
openaire +1 more source
Algorithmica, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James R. Knight, Eugene W. Myers
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James R. Knight, Eugene W. Myers
openaire +1 more source
2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018
In this paper, we study the spatial pattern matching (SPM) query. Given a set D of spatial objects (e.g., houses and shops), each with a textual description, we aim at finding all combinations of objects from D that match a user-defined spatial pattern P.
Yixiang Fang +4 more
openaire +1 more source
In this paper, we study the spatial pattern matching (SPM) query. Given a set D of spatial objects (e.g., houses and shops), each with a textual description, we aim at finding all combinations of objects from D that match a user-defined spatial pattern P.
Yixiang Fang +4 more
openaire +1 more source
Journal of Functional Programming, 2007
Abstract We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state the definition of these anomalies, building upon pattern matching semantics, and propose a simple algorithm to detect them. We have integrated the algorithm in the Objective Caml compiler, but we show that the same algorithm ...
openaire +1 more source
Abstract We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state the definition of these anomalies, building upon pattern matching semantics, and propose a simple algorithm to detect them. We have integrated the algorithm in the Objective Caml compiler, but we show that the same algorithm ...
openaire +1 more source
Pattern Recognition Letters, 1989
Summary: A technique based on goodness-of-fit statistics is presented for classification of binary images via template matching. The approach is essentially rotation invariant and is independent of the distribution generating the images. Its validity is demonstrated by application to comparison of binary images of aircraft.
Thomas G. Ryall, John Sandor
openaire +2 more sources
Summary: A technique based on goodness-of-fit statistics is presented for classification of binary images via template matching. The approach is essentially rotation invariant and is independent of the distribution generating the images. Its validity is demonstrated by application to comparison of binary images of aircraft.
Thomas G. Ryall, John Sandor
openaire +2 more sources