An Efficient Matching Algorithm for RDF Graph Patterns

2005 ◽  
Vol 42 (10) ◽  
pp. 1763 ◽  
Author(s):  
Jinling Wang
Keyword(s):  
Matching Algorithm ◽  
Rdf Graph ◽  
Efficient Matching

Efficient matching algorithm by a hybrid Hopfield network for object recognition

1992 ◽  
Author(s):  
Jung H. Kim ◽  
Sung H. Yoon ◽  
Yong H. Kim ◽  
Evi H. Park ◽  
Celestine A. Ntuen ◽  
...  
Keyword(s):  
Object Recognition ◽  
Hopfield Network ◽  
Matching Algorithm ◽  
Efficient Matching

A Pattern Matching Algorithm for Double-Type Characters

2014 ◽  
Vol 571-572 ◽  
pp. 461-464
Author(s):  
Hai Yan Zhou
Keyword(s):  
Pattern Matching ◽  
Chinese Characters ◽  
Cross Link ◽  
Data Link ◽  
Matching Algorithm ◽  
Order Of Magnitude ◽  
Link Data ◽  
Efficient Matching ◽  
Link Table ◽  
Double Cross

A fast and efficient matching algorithm is proposed to address the issue on multi-pattern matching of double-byte string, for example Chinese characters, which has major difference with single-byte string matching algorithm. The algorithm capitalizes on double cross link data list and two finite prefix automata to match a double-byte character, so as to solve the storage expansion problems in which the double-byte cross data link table results. The method requires less storage in comparison with double-byte cross data link table, and has the same order of magnitude in efficiency as a single-byte cross-link table approach.

scholarly journals An efficient matching algorithm applied in statistical physics

1994 ◽  
Vol 52 (2) ◽  
pp. 139-153 ◽  
Author(s):  
J. Bendisch ◽  
U. Derigs ◽  
A. Metz
Keyword(s):  
Statistical Physics ◽  
Matching Algorithm ◽  
Efficient Matching

A HOUGH-BASED MATCHING OF 2D LINE SEGMENTS IN A MONOCULAR IMAGE SEQUENCE

1996 ◽  
Vol 10 (06) ◽  
pp. 687-710 ◽  
Author(s):  
G. L. FORESTI ◽  
C. S. REGAZZONI
Keyword(s):  
Feature Space ◽  
Image Sequence ◽  
Additional Advantage ◽  
Matching Algorithm ◽  
Line Segments ◽  
Matching Process ◽  
Monocular Image ◽  
Straight Segments ◽  
Efficient Matching ◽  
Monocular Image Sequence

The paper describes a method for detecting 2D straight segments and their correspondences in successive frames of an image sequence by means of a Hough-based matching approach. The main advantage of this method is the possibility of extracting and matching 2D straight segments directly in the feature space, without the need for complex matching operations and time-consuming inverse transformations. An additional advantage is that only four attributes of 2D straight segments are required to perform an efficient matching process: position, orientation, length, and midpoint. Tests were performed on both synthetic and real images containing complex man-made objects moving in a scene. A comparison with a well-known 2D line matching algorithm is also made.

Sign in / Sign up

Export Citation Format

Share Document