Results 11 to 20 of about 319,166 (311)
PATTERN MATCHING IN MODELS [PDF]
Annals 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
, 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
Dul, J. (Jan), Hak, A. (Tony)
core +3 more sources
Proceedings 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
Outsourced pattern matching [PDF]
International 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]
Science 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
Matchings and Partial Patterns [PDF]
The 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
A memory-efficient deterministic finite automaton-based bit-split string matching scheme using pattern uniqueness in deep packet inspection. [PDF]
PLoS ONE, 2015 This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string
HyunJin Kim, Kang-Il Choi, Sang-Il Choi
doaj +1 more source
Permutation Pattern Matching for Doubly Partially Ordered Patterns [PDF]
, 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
Grouping Quick Search Matching Algorithm for Bit Steam [PDF]
Jisuanji gongcheng, 2017 In the pattern matching of bit stream,because the character sets of target string and pattern string are simple,the average jumping length of matching window is short during the matching process,making Quick Search(QS) matching not efficient.So this ...
TAO Zhao,YANG Jianbo,ZHANG Bo,ZHANG Liyun
doaj +1 more source
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source