Results 11 to 20 of about 321,392 (311)

PATTERN MATCHING IN MODELS [PDF]

open access: yesAnnals of Dunarea de Jos University. Fascicle I : Economics and Applied Informatics, 2005
The goal of this paper is to investigate how such a pattern matching could be performed on models,including the definition of the input language as well as the elaboration of efficient matchingalgorithms.
Cristian GEORGESCU
doaj   +1 more source

Pattern Matching [PDF]

open access: yes, 2009
Pattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern of measured values) with an “expected pattern” (a hypothesis), and
Hak, A., Dul, J.
openaire   +4 more sources

Embedded pattern matching

open access: yesProceedings of the 15th ACM SIGPLAN International Haskell Symposium, 2022
Haskell is a popular choice for hosting deeply embedded languages. A recurring challenge for these embeddings is how to seamlessly integrate user defined algebraic data types. In particular, one important, convenient, and expressive feature for creating and inspecting data -- pattern matching -- is not directly available on embedded terms. We present a
Trevor L. McDonell   +2 more
openaire   +3 more sources

PalFM-Index: FM-Index for Palindrome Pattern Matching [PDF]

open access: yes, 2023
The palindrome pattern matching (pal-matching) is a kind of generalized pattern matching, in which two strings x and y of same length are considered to match (pal-match) if they have the same palindromic structures, i.e., for any possible 1 ≤ i < j ≤ |x|
I, Tomohiro, Nagashita, Shinya
core   +1 more source

Outsourced pattern matching [PDF]

open access: yesInternational Journal of Information Security, 2013
In secure delegatable computation, computationally weak devices (or clients) wish to outsource their computation and data to an untrusted server in the cloud. While most earlier work considers the general question of how to securely outsource any computation to the cloud server, we focus on concrete and important functionalities and give the first ...
Sebastian Faust   +2 more
openaire   +5 more sources

Refactoring pattern matching [PDF]

open access: yesScience of Computer Programming, 2013
Defining functions by pattern matching over the arguments is advantageous for understanding and reasoning, but it tends to expose the implementation of a datatype. Significant effort has been invested in tackling this loss of modularity; however, decoupling patterns from concrete representations while maintaining soundness of reasoning has been a ...
Meng Wang 0002   +3 more
openaire   +3 more sources

Extending Graph Pattern Matching with Regular Expressions [PDF]

open access: yes, 2020
Graph pattern matching, which is to compute the set M(Q, G) of matches of Q in G, for the given pattern graph Q and data graph G, has been increasingly used in emerging applications e.g., social network analysis.
Xin Wang   +9 more
core   +1 more source

Parallel algorithm for pattern matching problems under substring consistent equivalence relations [PDF]

open access: yes, 2022
Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrences of the pattern in the text. An equivalence relation $\approx$ is called a substring consistent equivalence relation (SCER), if for two strings $X$ and $
Shinohara, Ayumi   +3 more
core   +1 more source

Matchings and Partial Patterns [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2010
A matching of size $2n$ is a partition of the set $[2n]=\{1,2,\dotsc,2n\}$ into $n$ disjoint pairs. A matching may be identified with a canonical sequence, which is a sequence of integers in which each integer $i\in[n]$ occurs exactly twice, and the first occurrence of $i$ precedes the first occurrence of $i+1$.
Vít Jelínek, Toufik Mansour
openaire   +2 more sources

Permutation Pattern Matching for Doubly Partially Ordered Patterns [PDF]

open access: yes, 2022
International audienceWe study in this paper the Doubly Partially Ordered Pattern Matching (or DPOP Matching) problem, a natural extension of the Permutation Pattern Matching problem.
Jugé, Vincent   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy