Search results for "Matching"
showing 10 items of 509 documents
Disrupting Industries With Blockchain: The Industry, Venture Capital Funding, and Regional Distribution of Blockchain Ventures
2016
The blockchain (i.e., a decentralized and encrypted digital ledger) has the potential to disrupt many traditional business models. This study investigates the emerging blockchain business-application landscape by analyzing its industry, venture capital funding, and regional distribution. We do so by matching four venture databases on blockchain-based startups. First, our results show that blockchain startups are most prominently represented in the Finance & Insurance and Information & Communication industries. A fine-grained analysis of financial services yields increasing novel applications in existing service offerings – especially in payment networks and processing. Second, consistent wi…
Refined Sellmeier equations from phase-matching measurements over the complete transparency range of KTiOAsO4, RbTiOAsO4 and CsTiOAsO4
2000
Sum- and difference- frequency generation phasematching properties are measured in spheres of KTiOAsO4, RbTiOAsO4 and CsTiOAsO4 for Sellmeier equations refinement over their complete transparency range.
MLOG: a strongly typed confluent functional language with logical variables
1994
Poirriez, V., MLOG: a strongly typed confluent functional language with logical variables, Theoretical Computer Science 122 (1994) 201-223. A new programming language called MLOG is introduced. MLOG is a conservative extension of ML with logical variables. To validate our concepts, a compiler named CAML Light FLU0 was implemented. Numerous examples are presented to illustrate the possibilities of MLOG. The pattern matching of ML is kept for X-calculus bindings and an unification primitive is introduced for the logical variables bindings. A suspension mechanism allows cohabitation of pattern-matching and logical variables, Although the evaluation strategy for the application is fixed, the or…
Keypoint descriptor matching with context-based orientation estimation
2014
Abstract This paper presents a matching strategy to improve the discriminative power of histogram-based keypoint descriptors by constraining the range of allowable dominant orientations according to the context of the scene under observation. This can be done when the descriptor uses a circular grid and quantized orientation steps, by computing or providing a global reference orientation based on the feature matches. The proposed matching strategy is compared with the standard approaches used with the SIFT and GLOH descriptors and the recent rotation invariant MROGH and LIOP descriptors. A new evaluation protocol based on an approximated overlap error is presented to provide an effective an…
Strong chromatic index of products of graphs
2007
Graphs and Algorithms
The pruning-grafting lattice of binary trees
2008
AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.
From Nerode's congruence to Suffix Automata with mismatches
2009
AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…
Motif patterns in 2D
2008
AbstractMotif patterns consisting of sequences of intermixed solid and don’t-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of …
Real-Time Assembly Support System with Hidden Markov Model and Hybrid Extensions
2022
This paper presents a context-aware adaptive assembly assistance system meant to support factory workers by embedding predictive capabilities. The research is focused on the predictor which suggests the next assembly step. Hidden Markov models are analyzed for this purpose. Several prediction methods have been previously evaluated and the prediction by partial matching, which was the most efficient, is considered in this work as a component of a hybrid model together with an optimally configured hidden Markov model. The experimental results show that the hidden Markov model is a viable choice to predict the next assembly step, whereas the hybrid predictor is even better, outperforming in so…
Irregular motion recovery in fluorescein angiograms
1997
Abstract Fluorescein angiography is a common procedure in ophthalmic practice, mainly to evaluate vascular retinopathies and choroidopathies from sequences of ocular fundus images. In order to compare the images, a reliable overlying is essential. This paper proposes some methods for the recovery of irregular motion in fluorescein angiograms (FA). The overlying is done by a three step procedure: detection of relevant points, matching points from different images and estimation of the assumed linear geometric transformation. A stochastic model (closely related to the general linear model) allows to fuse the second and third steps. Two different estimators of the geometric transformation are …