647,944 Hits in 6.9 sec

Off-line general handwritten word recognition using an approximate BEAM matching algorithm

J.T. Favata
2001 IEEE Transactions on Pattern Analysis and Machine Intelligence  
AbstractÐA recognition system for general isolated offline handwritten words using an approximate segment-string matching algorithm is described.  ...  Contextual information is used at this point and the lexicon is matched to the graph in a breath-first manner, under an appropriate metric.  ...  When such runs are identified, the algorithm tries to find matching runs on the upper contour.  ... 
doi:10.1109/34.955113 fatcat:wjqhitdnafbjhhmp2brtkjyqxa

Optimal Decoding of Stripe Patterns with Window Uniqueness Constraint [chapter]

Shuntaro Yamazaki, Masaaki Mochimaru
2013 Lecture Notes in Computer Science  
We propose an optimal algorithm for solving correspondences problem in one-shot depth acquisition using color stripe patterns composed of pseudo-random sequence (PRS).  ...  Our algorithm solves onedimensional matching in a globally optimal manner, imposing the uniqueness of subsequences in the PRS as a hard constraint.  ...  The algorithm described above is summarized in Algorithm 1. The computational complexity of the dual DPM is O(p 2 w) where p is the length of a color pattern and w is the length of an image line.  ... 
doi:10.1007/978-3-642-40303-3_1 fatcat:sqf22lsbgrbd3ktw254veq4v64

OMPPM: online multiple palindrome pattern matching

Hwee Kim, Yo-Sub Han
2015 Bioinformatics  
Availability and implementation: The source code for all algorithms is freely available at http://toc.  ...  Given a text T of length n and a pattern P of length m, we study the palindrome pattern matching problem that finds all indices i such that P and T ½i À m þ 1 : i are palequivalent.  ...  Now we present an algorithm that solves Pal-Matching using A. Based on the Knuth-Morris-Pratt algorithm, Algorithm 3 processes T in A and reports all end-indices of matching occurrences.  ... 
doi:10.1093/bioinformatics/btv738 pmid:26677963 fatcat:64sq5c2skjfh7kyimlbphovusa

Pattern Matching In Polyphonic Music As A Weighted Geometric Translation Problem

Anna Lubiw, Luke Tanur
2004 Zenodo  
ACKNOWLEDGEMENTS We thank Erna Van Daele for musical discussions and advice; Ian Munro for the idea of how to find the best k matches; and Therese Biedl, Dan Brown, and Anne-Marie Donovan for useful suggestions  ...  Black line segments indicate an exact match of a pattern (on the left) and an inexact match of the same pattern (on the right).  ...  An exact match is a translation of the pattern so that each line segment of the pattern exactly matches a line segment of the score. See Figure 1 .  ... 
doi:10.5281/zenodo.1417969 fatcat:pcpf4qgvzzb2tmzqdpb6dnpymi

Subject Index

2007 Journal of Discrete Algorithms  
Edit distance with move operations, 380 NP-completeness Searching for a set of correlated patterns, 149 N P-hard Generalized function matching, 514 On-line algorithm On-line load balancing made  ...  in wireless networks, 395 Linear time algorithm for the longest common repeat problem, 243; An upper bound on the hardness of exact matrix based motif discovery, 706 String matching Parameterized matching  ... 
doi:10.1016/s1570-8667(07)00076-7 fatcat:wfqxglrznfb6do3wyittd5pfbi

Graph pattern matching

Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Yinghui Wu, Yunpeng Wu
2010 Proceedings of the VLDB Endowment  
We show that with this revision, graph pattern matching can be performed in cubic-time, by providing such an algorithm.  ...  In addition, we define matching based on a notion of bounded simulation, an extension of graph simulation.  ...  For each pattern node u ∈ Vp, Match also initializes mat(u) and premv(u) based on P and M (lines 4-6).  ... 
doi:10.14778/1920841.1920878 fatcat:jolxrpnqpne4hlqfqn235ymwpu

On the Comparison Complexity of the String Prefix-Matching Problem

Dany Breslauer, Livio Colussi, Laura Toniolo
1998 Journal of Algorithms  
In an analysis of Simon's automata based string-matching algorithm Hancart [30] independently obtained the same bounds that were given in [7] for on-line prefix-matching algorithms (see also [16] ).  ...  And thus, lim n→∞ c P[1..m] online (n) n = C P[1..m] online . The upper bound of at most C P[1..m] online ×n comparisons is achieved by an algorithm that takes linear time and uses linear space.  ...  P[1..∞] online In contrast to the unaccounted pattern preprocessing step in the discussion about on-line prefix-matching algorithms.  ... 
doi:10.1006/jagm.1998.0948 fatcat:fxdnijkrsfdwrjmlf3qqlvsk4q

Fast bitwise pattern-matching algorithm for DNA sequences on modern hardware

Gıyasettin ÖZCAN, Osman Sabri ÜNSAL
2015 Turkish Journal of Electrical Engineering and Computer Sciences  
We introduce a fast bitwise exact pattern-matching algorithm, which speeds up short-length pattern searches on large-sized DNA databases. Our contributions are two-fold.  ...  Compared to five state-of-the-art pattern-matching algorithms, experimental results show that our technique outperforms the best algorithm even for the worst-case DNA pattern for our technique.  ...  What is necessary is to design a string-matching algorithm from the ground up with an eye towards its efficient execution on modern processors.  ... 
doi:10.3906/elk-1304-165 fatcat:o3to2puacfgu5naql57ljs2pti

String-matching on ordered alphabets

Maxime Crochemore
1992 Theoretical Computer Science  
., String-matching on ordered alphabets, Theoretical Computer Science 92 (1992) 33-47. We present a new string-matching algorithm that exploits an ordering of the alphabet.  ...  The algorithm can also be turned into a real-time string-matching algorithm. 0304-3975/92/$05.00 ,c' 1992-Elsevier Science Publishers B.V. All rights reserved  ...  The property leads to the string-matching algorithm of Fig. 11 which itself adapts to an exact computation of periods by an optimal and on-line algorithm.  ... 
doi:10.1016/0304-3975(92)90134-2 fatcat:qf6jkuovxzbq7lp74uzhmq3yum

Page 7655 of Mathematical Reviews Vol. , Issue 95m [page]

1995 Mathematical Reviews  
This paper presents an efficient on-line dictionary- matching algorithm for the case where the patterns have uniform length and the input alphabet is unbounded.  ...  In an immediate application, the new dictionary-matching algo- rithm can be used in a previously known higher-dimensional array- matching algorithm, improving the performance of this algorithm on unbounded  ... 

A unifying look at the Apostolico–Giancarlo string-matching algorithm

Maxime Crochemore, Christophe Hancart, Thierry Lecroq
2003 Journal of Discrete Algorithms  
One of the most famous string matching algorithm was given in 1977 by Boyer and Moore [2] .  ...  A major difficulty when one wants to implement the Boyer-Moore algorithm is to understand the computation of the "matching shift" which is one of the two shift functions usually used by the algorithm.  ...  Conclusion We gave a new method to compute the strong matching shift of the Boyer-Moore algorithm. This method is simpler than the previous published methods.  ... 
doi:10.1016/s1570-8667(03)00005-4 fatcat:cpnzzl3mkvah5ha3yj5lkrltle

Inexact graph matching using a genetic algorithm for image recognition

Surapong Auwatanamongkol
2007 Pattern Recognition Letters  
Exact graph matching using a genetic algorithm for image recognition has been introduced in previously published work. The algorithm was based on angle matching between two given graphs.  ...  This paper presents modifications such as the introduction of node exemption, inexact matching between straight lines and curves in the graphs and consideration of rotational degrees of the graphs.  ...  When a line on the input graph is matched to a line on the known pattern graph, the corresponding starting and ending nodes of the two lines are matched with each other.  ... 
doi:10.1016/j.patrec.2007.02.013 fatcat:gfzujy6asrdbbh6elidscc3zpq

A Flexible Pattern-Matching Algorithm for Network Intrusion Detection Systems Using Multi-Core Processors

2017 Algorithms  
In this paper, we describe our proposal for an efficient and flexible pattern-matching algorithm for inspecting packet payloads using a head-body finite automaton (HBFA).  ...  We therefore focused our efforts on designing a pattern-matching algorithm for software-based NIDSs. Software-based NIDS throughput is highly dependent on processor computing power.  ...  They found that the match ratio of an input stream with respect to a given pattern set exerts a significant impact on AC-DFA throughput.  ... 
doi:10.3390/a10020058 fatcat:f63yugzwu5a5pdrixejrx5te3u

On the Comparison Complexity of the String Prefix-Matching Problem

Dany Breslauer, Livio Colussi, Laura Toniolo
1995 BRICS Report Series  
We derive almost tight lower and upper bounds on<br />the number of symbol comparisons required in the worst case by on-line<br />prefix-matching algorithms for any fixed pattern and variable text.  ...  Unlike<br />previous results on the comparison complexity of string-matching and<br />prefix-matching algorithms, our bounds are almost tight for any particular pattern.  ...  P[1..∞] online In contrast to the unaccounted pattern preprocessing step in the discussion about on-line prefix-matching algorithms.  ... 
doi:10.7146/brics.v2i46.19947 fatcat:baepxybqrbbizozaswgl333h7e

A programmable dynamic interconnection network router with hidden refresh

J.G. Delgado-Frias, J. Nyathi, D.H. Summerville
1998 IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications  
Index Terms-Content addressable memory, dynamic circuits, matching with ternary digits, parallel comparison, pipelining, routing algorithm execution, ternary digit logic. José G. Delgado-Frias  ...  The router executes routing algorithms in 1.5 clock cycles, this being the fastest approach for flexible routers.  ...  Hypertree Routing Algorithm and its Bit-Pattern Mapping Based on the features and requirements of the hypertree, an algorithm has been adapted from [7] .  ... 
doi:10.1109/81.735440 fatcat:ri7lwq24r5aqnjhyi5d3ly5why
« Previous Showing results 1 — 15 out of 647,944 results