Search results
Jump to navigation
Jump to search
Page title matches
- {{Short description|String-matching algorithm}} ...lp.html National Institute of Standards and Technology] Ratcliff/Obershelp pattern recognition</ref> ...7 KB (970 words) - 01:59, 15 February 2025
Page text matches
- ...son about the correctness of computer programs. Its operators use pattern matching to operate on the [[power set]] of states, rather than the set of states. ...rns.<ref name="original">{{cite journal |last1=Roșu |first1=Grigore |title=Matching Logic |journal=Logical Methods in Computer Science |date=2017 |url=https:// ...3 KB (522 words) - 14:20, 2 April 2024
- {{Short description|String-matching algorithm}} ...lp.html National Institute of Standards and Technology] Ratcliff/Obershelp pattern recognition</ref> ...7 KB (970 words) - 01:59, 15 February 2025
- {{Short description|Compressed data structure for pattern matching}} ...uary 2003, 841–850.</ref> is a [[compressed data structure]] for [[pattern matching]]. Compressed suffix arrays are a general class of [[data structure]] that ...6 KB (859 words) - 00:53, 6 December 2024
- == Solving the Pattern Matching Problem == Generalized suffix arrays can be used to solve the [[pattern matching]] problem:<ref>{{Citation|last1=Aluru|first1=Srinivas|url=http://web.cs.ias ...7 KB (1,114 words) - 00:44, 18 November 2023
- ...ld and Tomasi (1998)</ref> It is used as a dissimilarity measure in stereo matching, where one-dimensional search for correspondences is performed to recover a ...the continuous light signal over a finite region of space, and two pixels matching the same feature of the image content may correspond to slightly different ...5 KB (854 words) - 22:08, 18 April 2022
- ...s a subset of the problem of matching [[regular expressions]] and [[string matching]] in general.<ref>{{cite web| last=Goyvaerts| first=Jan| title=Welcome to R A wildcard matcher tests a wildcard pattern ''p'' against an input string ''s''. It performs an ''anchored'' match, ret ...14 KB (2,015 words) - 18:59, 25 October 2024
- ...s.org/content/14/1/55.short Rigoutsos, I, Floratos, A (1998) Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm. Bioinformatics ...exactly ''k'' times in the input then all fragments (sub patterns) of the pattern have to appear <u>at least</u> ''k'' times in the input. The algorithm is a ...6 KB (1,015 words) - 07:44, 6 December 2023
- ...orithm]], the basic application of which is searching for occurrences of a pattern <math>P</math> in a text <math>T</math>. As with other comparison-based str ...tterns and texts, this is very inefficient – a simple example is when both pattern and text consist of the same repeated character, in which case Boyer–Moore ...3 KB (485 words) - 18:10, 20 October 2023
- ==Generation through matching== ...ative character and do not represent additional [[matching rules (tilings)|matching rules]] as this is already taken care of by the indentations and protrusion ...5 KB (794 words) - 06:39, 15 April 2024
- ...ns, where the second pattern <code>number</code> uses the previously named pattern <code>digit</code>: The Rules section defines pattern-action pairs. The following example defines a rule to translate a number t ...15 KB (2,156 words) - 18:25, 1 March 2025
- ...ks]] can be placed without attacking each other. Equivalently, it is the [[matching complex]] of the (''m'', ''n'')-[[complete bipartite graph]], or the [[inde Another definition is the set of all [[Matching (cards)|matchings]] in the complete [[bipartite graph]] <math>K_{m,n}</math ...8 KB (1,130 words) - 14:54, 21 August 2023
- ...ics]] and [[theoretical computer science]], a pattern is an '''unavoidable pattern''' if it is unavoidable on any finite alphabet. === Pattern === ...18 KB (3,150 words) - 10:27, 7 October 2024
- |title=A distance measure between attributed relational graphs for pattern recognition A major application of graph edit distance is in [[inexact graph matching]], such ...13 KB (1,723 words) - 03:20, 8 February 2025
- ...2012 |conference= IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) |publisher= IEEE Computer Society |location=Providence ..._{5\times 5}^{\left\lbrace \mathrm{3,4}\right\rbrace }</math>, and [[Block-matching and 3D filtering|BM3D]]. ...5 KB (742 words) - 02:21, 11 September 2024
- '''Contextual image classification''', a topic of [[pattern recognition]] in [[computer vision]], is an approach of [[Classification in === Template matching === ...9 KB (1,451 words) - 09:51, 22 December 2023
- It can be used to efficiently find the number of occurrences of a pattern within the compressed text, as well as locate the position of each occurren ...based on traditional compression methods and tried to solve the compressed matching problem. In contrast, the FM-index is a compressed self-index, which means ...10 KB (1,588 words) - 00:56, 6 December 2024
- ...//monge.univ-mlv.fr/~mac/Articles-PDF/CP-1991-jacm.pdf}}</ref> It takes a pattern of size ''m'', called a “needle”, preprocesses it in linear time [[Landau n Like those two, the 2-way algorithm preprocesses the pattern to find partially repeating periods and computes “shifts” based on them, in ...10 KB (1,419 words) - 19:10, 28 January 2025
- ...d as a mathematical tool for shape comparison in [[computer vision]] and [[pattern recognition]].<ref>Alessandro Verri, Claudio Uras, Patrizio Frosini and Mas ...me="dAFrLa06">Michele d'Amico, Patrizio Frosini and Claudia Landi, ''Using matching distance in Size Theory: a survey'', International Journal of Imaging Syste ...6 KB (758 words) - 01:22, 4 April 2023
- ...xpression to an NFA |pages=64–69}}</ref> This NFA can be used to [[pattern matching|match strings]] against the regular expression. This algorithm is credited ...{{mvar|n}} in time {{math|''O''(''emn'')}}, a Thompson NFA can do pattern matching in linear time, assuming a fixed-size alphabet.<ref>{{cite web |first=Guang ...14 KB (1,764 words) - 09:32, 2 March 2025
- ...e objects in their order around a [[circle]], and drawing the pairs of the matching as [[Chord (geometry)|chords]] of the circle. ...rdered set in which no two chords cross each other.{{r|fn00}} The crossing pattern of chords in a chord diagram may be described by a [[circle graph]], the [[ ...5 KB (662 words) - 01:03, 30 April 2024