All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 75 Next

Displaying 1481 – 1500 of 4962

Showing per page

Deformed fuzzy automata for the Text Error Correction Problem.

F. Javier Echanobe Arias, José Ramón Garitagoitia, José Ramón González de Mendívil, José Javier Astráin (2000)

Mathware and Soft Computing

A fuzzy method for the text error correction problem is introduced. The method is able to handle insert, delete and substitution errors. Moreover, it uses the measurement level output that an Isolated Character Classifier can provide. The method is based on a Deformed System, in particular, a deformed fuzzy automaton is defined to model the possible errors in the words of the texts. Experimental results show good performance in correcting the three types of errors.

Degradation in probability logic: When more information leads to less precise conclusions

Christian Wallmann, Gernot D. Kleiter (2014)

Kybernetika

Probability logic studies the properties resulting from the probabilistic interpretation of logical argument forms. Typical examples are probabilistic Modus Ponens and Modus Tollens. Argument forms with two premises usually lead from precise probabilities of the premises to imprecise or interval probabilities of the conclusion. In the contribution, we study generalized inference forms having three or more premises. Recently, Gilio has shown that these generalized forms “degrade” – more premises...

Dejean's conjecture and letter frequency

Jérémie Chalopin, Pascal Ochem (2008)

RAIRO - Theoretical Informatics and Applications

We prove two cases of a strong version of Dejean's conjecture involving extremal letter frequencies. The results are that there exist an infinite 5 4 + -free word over a 5 letter alphabet with letter frequency 1 6 and an infinite 6 5 + -free word over a 6 letter alphabet with letter frequency 1 5 .

Dejean's conjecture holds for N ≥ 27

James Currie, Narad Rampersad (2009)

RAIRO - Theoretical Informatics and Applications

We show that Dejean's conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.

Denoising Manifolds for Dimension

Jammalamadaka, Arvind K. (2009)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 68T01, 62H30, 32C09.Locally Linear Embedding (LLE) has gained prominence as a tool in unsupervised non-linear dimensional reduction. While the algorithm aims to preserve certain proximity relations between the observed points, this may not always be desirable if the shape in higher dimensions that we are trying to capture is observed with noise. This note suggests that a desirable first step is to remove or at least reduce the noise in the observations before...

Denotational aspects of untyped normalization by evaluation

Andrzej Filinski, Henning Korsholm Rohde (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We show that the standard normalization-by-evaluation construction for the simply-typed λ β η -calculus has a natural counterpart for the untyped λ β -calculus, with the central type-indexed logical relation replaced by a “recursively defined” invariant relation, in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal forms,...

Denotational aspects of untyped normalization by evaluation

Andrzej Filinski, Henning Korsholm Rohde (2010)

RAIRO - Theoretical Informatics and Applications

We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus has a natural counterpart for the untyped λβ-calculus, with the central type-indexed logical relation replaced by a “recursively defined” invariant relation, in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal...

Denotational semantics of languages with fuzzy data.

Daniel Sánchez Alvarez, Antonio F. Gómez Skarmeta (2000)

Mathware and Soft Computing

The denotational semantics of a programming language which manages fuzzy data is presented. The introduction of blocks poses problems regarding transmission, both for the degree at which the work is carried out and for triangular operations necessary for the evaluation of the degrees of the fuzzy data. We propose some solutions. The possibility of defining linguistic variables is provided.

Density estimation with quadratic loss: a confidence intervals method

Pierre Alquier (2008)

ESAIM: Probability and Statistics

We propose a feature selection method for density estimation with quadratic loss. This method relies on the study of unidimensional approximation models and on the definition of confidence regions for the density thanks to these models. It is quite general and includes cases of interest like detection of relevant wavelets coefficients or selection of support vectors in SVM. In the general case, we prove that every selected feature actually improves the performance of the estimator. In the case...

Density of critical factorizations

Tero Harju, Dirk Nowotka (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We investigate the density of critical factorizations of infinite sequences of words. The density of critical factorizations of a word is the ratio between the number of positions that permit a critical factorization, and the number of all positions of a word. We give a short proof of the Critical Factorization Theorem and show that the maximal number of noncritical positions of a word between two critical ones is less than the period of that word. Therefore, we consider only words of index one,...

Density of Critical Factorizations

Tero Harju, Dirk Nowotka (2010)

RAIRO - Theoretical Informatics and Applications

We investigate the density of critical factorizations of infinite sequences of words. The density of critical factorizations of a word is the ratio between the number of positions that permit a critical factorization, and the number of all positions of a word. We give a short proof of the Critical Factorization Theorem and show that the maximal number of noncritical positions of a word between two critical ones is less than the period of that word. Therefore, we consider only words of...

Depth lower bounds for monotone semi-unbounded fan-in circuits

Jan Johannsen (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The depth hierarchy results for monotone circuits of Raz and McKenzie [5] are extended to the case of monotone circuits of semi-unbounded fan-in. It follows that the inclusions N C i ⊆ S A C i ⊆ A C i are proper in the monotone setting, for every i ≥ 1 .

Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits

Jan Johannsen (2010)

RAIRO - Theoretical Informatics and Applications

The depth hierarchy results for monotone circuits of Raz and McKenzie [5] are extended to the case of monotone circuits of semi-unbounded fan-in. It follows that the inclusions NCi ⊆ SACi ⊆ ACi are proper in the monotone setting, for every i ≥ 1.

Des explications pour reconnaître et exploiter les structures cachées d’un problème combinatoire

Hadrien Cambazard, Narendra Jussien (2006)

RAIRO - Operations Research - Recherche Opérationnelle

L’identification de structures propres à un problème est souvent une étape clef pour la conception d’heuristiques de recherche comme pour la compréhension de la complexité du problème. De nombreuses approches en Recherche Opérationnelle emploient des stratégies de relaxation ou de décomposition dès lors que certaines struc- tures idoines ont été identifiées. L’étape suivante est la conception d’algorithmes de résolution qui puissent intégrer à la volée, pendant la résolution, ce type d’information....

Currently displaying 1481 – 1500 of 4962