The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 1341 –
1360 of
4977
Cet article constitue une présentation unifiée des principales méthodes de construction du treillis de Galois d'une correspondance. Nous rappelons d'abord sa définition, puis nous décrivons quatre algorithmes de construction des éléments du treillis qui sont les rectangles maximaux de la relation binaire. Ces algorithmes ne sont pas originaux. Les descriptions précises de algorithmes, le plus souvent absentes des publications originales, permettent une programmation simple, dans un langage procédural...
A deterministic automaton recognizing a given
ω-regular language
is constructed from an ω-regular expression
with the help of derivatives.
The construction is related to Safra's algorithm,
in about the same way as the classical
derivative method is related to the subset construction.
Although a nonlinear discrimination function may be superior to linear or quadratic classifiers, it is difficult to construct such a function. In this paper, we propose a method to construct a nonlinear discrimination function using Legendre polynomials. The selection of an optimal set of Legendre polynomials is determined by the MDL (Minimum Description Length) criterion. Results using many real data show the effectiveness of this method.
Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi from words...
Since recognizable tree languages are closed under the rational
operations, every regular tree expression denotes a recognizable
tree language. We provide an alternative proof to this fact that
results in smaller tree automata. To this aim, we transfer
Antimirov's partial derivatives from regular word expressions to
regular tree expressions. For an analysis of the size of the
resulting automaton as well as for algorithmic improvements, we also
transfer the methods of Champarnaud and Ziadi...
We consider the multiparty communication model defined
in [4] using the formalism from [8]. First, we correct
an inaccuracy in the proof of the
fundamental result of [6] providing a lower bound on the
nondeterministic communication complexity of a function.
Then we construct several very hard functions, i.e., functions such
that those as
well as their complements
have the worst possible nondeterministic
communication complexity.
The problem to find a particular very hard function was...
The main purpose of this work is to present new families of transcendental continued fractions with bounded partial quotients. Our results are derived thanks to combinatorial transcendence criteria recently obtained by the first two authors in [3].
Currently displaying 1341 –
1360 of
4977