Search results for "methodologies"
showing 10 items of 2106 documents
Une expérience professionnelle à l'étranger est-elle payante en début de carrière pour les diplômés de l'enseignement supérieur ? (Note de recherche)
2008
09030 - http://remi.revues.org/index4823.html
An Heuristic Approach for the Training Dataset Selection in Fingerprint Classification Tasks
2015
Fingerprint classification is a key issue in automatic fingerprint identification systems. It aims to reduce the item search time within the fingerprint database without affecting the accuracy rate. In this paper an heuristic approach using only the directional image information for the training dataset selection in fingerprint classification tasks is described. The method combines a Fuzzy C-Means clustering method and a Naive Bayes Classifier and it is composed of three modules: the first module builds the working datasets, the second module extracts the training images dataset and, finally, the third module classifies fingerprint images in four classes. Unlike literature approaches using …
A decidable word problem without equivalent canonical term rewriting system
1989
We present a weak associative single-axiom system having the following property: the word problem is decidable with an efficient algorithm even though there does not exist any finite equivalent canonical term rewriting system.
Exact, efficient, and complete arrangement computation for cubic curves
2006
AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…
Generation of Valid Labeled Binary Trees
2003
International audience; Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.
Computational Aspects in Spaces of Bivariate Polynomial of w-Degree n
2005
Multivariate ideal interpolation schemes are deeply connected with H-bases. Both the definition of a H-basis and of an ideal interpolation space depend of the notion of degree used in the grading decomposition of the polynomial spaces. We studied, in the case of bivariate polynomials, a generalized degree, introduced by T. Sauer and named w-degree. This article give some theoretical results that allow us to construct algorithms for calculus of the dimension of the homogeneous spaces of bivariate polynomials of w – degree n. We implemented these algorithms in C++ language. The analysis of the results obtained, leads us to another theoretical conjecture which we proved in the end.
Guaranteed error bounds for a class of Picard-Lindelöf iteration methods
2013
We present a new version of the Picard-Lindelof method for ordinary dif- ¨ ferential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of an approximation error. The upper bounds are based on the Ostrowski estimates and the Banach fixed point theorem for contractive operators. The estimates derived in the paper take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations. peerReviewed
Degree of monotonicity in aggregation process
2010
In this paper we introduce a fuzzy order relation notion in the description of aggregation process. Namely, we use the fuzzy order relation to define the degree of monotonicity, which is equal to 1 for a monotone function with respect to a crisp order relation. In that case, integration of fuzzy order relation allows us to generalize the notion of monotonicity and we try to investigate the benefits of using fuzzy relations instead of a crisp relation. Further we illustrate this definition by examples and study the properties of aggregation functions which have a certain degree of monotonicity.
Regular Varieties of Automata and Coequations
2015
In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Ll´opez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata satisfying sets of coequations called varieties of languages. We show how our results are related to Birkhoff’s theorem for regular varieties.
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
2007
The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…