Results 61 to 70 of about 566,299 (120)
Matching of lateral cephalograms by means of similarity coefficients
Australasian Orthodontic Journal, 1986 This was a pilot study to establish the possible applications of taxonomic methods (taxonomy = study of the general principles of classification) to the identification of individuals.
Seliga Michelle E. +2 more
doaj +1 more source
Matching Patterns with Variables [PDF]
arXiv, 2019 A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern matches a given word, is generally NP-complete, but can be solved in polynomial-time for classes of patterns with ...
arxiv
Methods for Domain Specification of Verification-Oriented Process Ontology
Моделирование и анализ информационных систем, 2019 User-friendly formal specifications and verification of parallel and distributed systems from various subject fields, such as automatic control, telecommunications, business processes, are active research topics due to its practical significance. In this
Natalia O. Garanina +3 more
doaj +1 more source
The Algebra of Patterns (Extended Version) [PDF]
arXivPattern matching is a popular feature in functional, imperative and object-oriented programming languages. Language designers should therefore invest effort in a good design for pattern matching. Most languages choose a first-match semantics for pattern matching; that is, clauses are tried in the order in which they appear in the program until the ...
arxiv
Coverage Semantics for Dependent Pattern Matching [PDF]
arXivDependent pattern matching is a key feature in dependently typed programming. However, there is a theory-practice disconnect: while many proof assistants implement pattern matching as primitive, theoretical presentations give semantics to pattern matching by elaborating to eliminators.
arxiv
Capturing Topology in Graph Pattern Matching [PDF]
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 4, pp.
310-321 (2011), 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. These extensions allow pattern matching to be conducted in cubic-time.
arxiv
The dynamics of pattern matching in camouflaging cuttlefish. [PDF]
Nature, 2023 Woo T +6 more
europepmc +1 more source
XMiner: Efficient Directed Subgraph Matching with Pattern Reduction [PDF]
arXivGraph pattern matching, one of the fundamental graph mining problems, aims to extract structural patterns of interest from an input graph. The state-of-the-art graph matching algorithms and systems are mainly designed for undirected graphs. Directed graph matching is more complex than undirected graph matching because the edge direction must be taken ...
arxiv
Disentangling Abstraction from Statistical Pattern Matching in Human and Machine Learning. [PDF]
PLoS Comput Biol, 2023 Kumar S +4 more
europepmc +1 more source
Hardware acceleration of DNA pattern matching using analog resistive CAMs
Frontiers in ElectronicsDNA pattern matching is essential for many widely used bioinformatics applications. Disease diagnosis is one of these applications since analyzing changes in DNA sequences can increase our understanding of possible genetic diseases. The remarkable growth
Jinane Bazzi +5 more
doaj +1 more source