Results 51 to 60 of about 566,299 (120)

Unique Pattern Matching in Strings [PDF]

open access: yesarXiv, 2003
Regular expression patterns are a key feature of document processing languages like Perl and XDuce. It is in this context that the first and longest match policies have been proposed to disambiguate the pattern matching process. We formally define a matching semantics with these policies and show that the generally accepted method of simulating longest
arxiv  

A Hybrid Approach to Temporal Pattern Matching [PDF]

open access: yesarXiv, 2020
The primary objective of graph pattern matching is to find all appearances of an input graph pattern query in a large data graph. Such appearances are called matches. In this paper, we are interested in finding matches of interaction patterns in temporal graphs.
arxiv  

Towards Building a Uniform Cloud Database Representation for Data Interchange

open access: yesAnnals of the West University of Timisoara: Mathematics and Computer Science, 2016
The paper proposes design principles for data representation and simplification in order to design cloud services for data exchange between various information systems. We use equivalence algorithms and canonical representation in the cloud database. The
Andreica Alina
doaj   +1 more source

Extensible Pattern Matching in an Extensible Language [PDF]

open access: yesarXiv, 2011
Pattern matching is a widely used technique in functional languages, especially those in the ML and Haskell traditions, where it is at the core of the semantics. In languages in the Lisp tradition, in contrast, pattern matching it typically provided by libraries built with macros.
arxiv  

Arboreal Identification Supported by Fuzzy Modeling for Trunk Texture Recognition

open access: yesTrends in Computational and Applied Mathematics, 2018
Due to the natural variability of the arboreal bark there are texture patterns in trunk images with values belonging to more than one species. Thus, the present study analyzed the usage of fuzzy modeling as an alternative to handle the uncertainty in the
Adriano Bressane   +4 more
doaj   +1 more source

Cartesian Tree Matching and Indexing [PDF]

open access: yesarXiv, 2019
We introduce a new metric of match, called Cartesian tree matching, which means that two strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we define single pattern matching for a text of length n and a pattern of length m, and multiple pattern matching for a text of length n and k patterns of total length m.
arxiv  

New pattern matching conditions for wreath products of the cyclic groups with symmetric groups [PDF]

open access: yesarXiv, 2009
We present several multi-variable generating functions for a new pattern matching condition on the wreath product of the cyclic group and the symmetric group. Our new pattern matching condition requires that the underlying permutations match in the usual sense of pattern matching for the symmetric group and that the corresponding sequence of signs ...
arxiv  

GraphPi: High Performance Graph Pattern Matching through Effective Redundancy Elimination [PDF]

open access: yesarXiv, 2020
Graph pattern matching, which aims to discover structural patterns in graphs, is considered one of the most fundamental graph mining problems in many real applications. Despite previous efforts, existing systems face two main challenges. First, inherent symmetry existing in patterns can introduce a large amount of redundant computation.
arxiv  

Text Indexing for Faster Gapped Pattern Matching

open access: yesAlgorithms
We revisit the following version of the Gapped String Indexing problem, where the goal is to preprocess a text T[1..n] to enable efficient reporting of all occ occurrences of a gapped pattern P=P1[α..β]P2 in T.
Md Helal Hossen   +2 more
doaj   +1 more source

On the Average-case Complexity of Pattern Matching with Wildcards [PDF]

open access: yesarXiv, 2014
Pattern matching with wildcards is the problem of finding all factors of a text $t$ of length $n$ that match a pattern $x$ of length $m$, where wildcards (characters that match everything) may be present. In this paper we present a number of fast average-case algorithms for pattern matching where wildcards are restricted to either the pattern or the ...
arxiv  

Home - About - Disclaimer - Privacy