Skip to search formSkip to main contentSkip to account menu

Optimal matching

Optimal matching is a sequence analysis method used in social science, to assess the dissimilarity of ordered arrays of tokens that usually represent… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Cluster analysisCounterfactual conditionalDynamic time warpingLevenshtein distance

Broader (1)

Data mining

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A Fast Template Matching Method With Rotation Invariance by Combining the Circular Projection Transform Process and Bounded Partial Correlation
This letter proposes an algorithm for rotation invariance template matching by combining the circular projection transformation… 
2012
2012
On-line scheduling of equal-length intervals on parallel machines
2007
2007
Optimal distributed planning of multi-robot placement on a 3D truss
This paper considers the problem of allocating tasks among robots that operate on a 3D truss. Each robot is commanded to navigate… 
2005
2005
Network Problems with Non-Polynomial Weights And Applications
The most efficient algorithms for several network problems like minimum cost flow and the maximum weight matching problem follow… 
Highly Cited
2002
Highly Cited
2002
Gene Matching Using JBits
As the emerging field of bioinformatics continues to expand, the ability to rapidly search large databases of genetic information… 
2000
2000
A sound algorithm for region-based image retrieval using an index
Region-based image retrieval systems aim to improve the effectiveness of content-based search by decomposing each image into a… 
1998
1998
Multi-stroke relaxation matching method for handwritten chinese character recognition
Highly Cited
1996
Highly Cited
1996
Software for optimal matching in observational studies.
A seat member is horizontally mounted on a pair of scissor-like arranged levers for movement in upward and downward directions. A… 
1994
1994
Matching and scheduling in a generalized optimal selection theory
Studies a model for matching and scheduling a task structure onto a heterogeneous suite of computers. The paper first generalizes… 
1990
1990
An optimal matching-score net for pattern classification
A novel optimal model is obtained for the matching score subnet of a pattern classifier network by requiring that the model… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)