Results 21 to 30 of about 321,392 (311)

Capturing Topology in Graph Pattern Matching [PDF]

open access: yes, 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

Spintronic In-Memory Pattern Matching

open access: yesIEEE Journal on Exploratory Solid-State Computational Devices and Circuits, 2019
Traditional Von Neumann computing is falling apart in the era of exploding data volumes as the overhead of data transfer becomes forbidding. Instead, it is more energy-efficient to fuse compute capability with memory where the data reside.
Zamshed I. Chowdhury   +8 more
doaj   +1 more source

Camera focusing based on fringe pattern matching [PDF]

open access: yes, 1997
A method of camera focusing based on fringe pattern matching is presented. In the method, the variance of the mismatch function is used as a focus measure.
Bryanston-Cross, P., Wang, Zuobin
core   +1 more source

Palindrome Pattern Matching

open access: yesTheoretical Computer Science, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomohiro I   +2 more
openaire   +1 more source

Pattern Matching in Strings [PDF]

open access: yes, 1998
The present chapter describes a few standard algorithms used for processing texts.
Crochemore, Maxime, Hancart, Christophe
openaire   +5 more sources

A memetic fingerprint matching algorithm [PDF]

open access: yes, 2007
Minutiae point pattern matching is the most common approach for fingerprint verification. Although many minutiae point pattern matching algorithms have been proposed, reliable automatic fingerprint verification remains as a challenging problem, both with
Howells, Gareth   +3 more
core   +1 more source

On-Line Pattern Matching on D-Texts (Invited Talk) [PDF]

open access: yes, 2021
The Elastic Degenerate String Matching (EDSM) problem is defined as that of finding an occurrence of a pattern P of length m in an ED-text T. A D-text (Degenerate text) is a string that actually represents a set of similar and aligned strings (e.g. a pan-
Nadia Pisanti, Pisanti, Nadia
core   +1 more source

Research on Uyghur Pattern Matching Based on Syllable Features

open access: yesInformation, 2020
Pattern matching is widely used in various fields such as information retrieval, natural language processing (NLP), data mining and network security. In Uyghur (a typical agglutinative, low-resource language with complex morphology, spoken by the ethnic ...
Wayit Abliz   +6 more
doaj   +1 more source

Anti-pattern Matching [PDF]

open access: yes, 2007
It is quite appealing to base the description of pattern-based searches on positive as well as negative conditions. We would like for example to specify that we search for white cars that are not station wagons. To this end, we define the notion of anti-patterns and their semantics along with some of their properties.
Kirchner, Claude   +2 more
openaire   +2 more sources

Order-Preserving Pattern Matching Indeterminate Strings [PDF]

open access: yes, 2018
Given an indeterminate string pattern p and an indeterminate string text t, the problem of order-preserving pattern matching with character uncertainties (muOPPM) is to find all substrings of t that satisfy one of the possible orderings defined by p ...
Russo, Luís M. S.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy