Conjugacy in Pattern Recognition and Choice Problems
Conjugacy of subgroups of the general linear group.
Connected components of sets of finite perimeter and applications to image processing
This paper contains a systematic analysis of a natural measure theoretic notion of connectedness for sets of finite perimeter in , introduced by H. Federer in the more general framework of the theory of currents. We provide a new and simpler proof of the existence and uniqueness of the decomposition into the so-called -connected components. Moreover, we study carefully the structure of the essential boundary of these components and give in particular a reconstruction formula of a set of finite...
Connectedness of fractals associated with Arnoux–Rauzy substitutions
Rauzy fractals are compact sets with fractal boundary that can be associated with any unimodular Pisot irreducible substitution. These fractals can be defined as the Hausdorff limit of a sequence of compact sets, where each set is a renormalized projection of a finite union of faces of unit cubes. We exploit this combinatorial definition to prove the connectedness of the Rauzy fractal associated with any finite product of three-letter Arnoux–Rauzy substitutions.
Connections between binary patterns and paperfolding
Connections between object classification criteria using an ultrasonic bi-sonar system
The paper presents connections between the criteria which make three types of objects possible to be recognized, namely, edges, planes and corners. These criteria can be applied while a binaural sonar system is used. It is shown that the criteria are specific forms of a general equation. The form of the equation depends on a single coefficient. In the paper, the meaning of this coefficient is discussed. The constructions of the arrangement of objects are presented and are bound with values of the...
Connectivity of planar graphs.
Consensual languages and matching finite-state computations
An ever present, common sense idea in language modelling research is that, for a word to be a valid phrase, it should comply with multiple constraints at once. A new language definition model is studied, based on agreement or consensus between similar strings. Considering a regular set of strings over a bipartite alphabet made by pairs of unmarked/marked symbols, a match relation is introduced, in order to specify when such strings agree. Then a regular set over the bipartite alphabet can be interpreted...
Consensual languages and matching finite-state computations
An ever present, common sense idea in language modelling research is that, for a word to be a valid phrase, it should comply with multiple constraints at once. A new language definition model is studied, based on agreement or consensus between similar strings. Considering a regular set of strings over a bipartite alphabet made by pairs of unmarked/marked symbols, a match relation is introduced, in order to specify when such strings agree. Then a regular set over the bipartite alphabet can be interpreted...
Consensus and trajectory tracking of SISO linear multi-agent systems under switching communication topologies and formation changes
The simultaneous problem of consensus and trajectory tracking of linear multi-agent systems is considered in this paper, where the dynamics of each agent is represented by a single-input single-output linear system. In order to solve this problem, a distributed control strategy is proposed in this work, where the trajectory and the formation of the agents are achieved asymptotically even in the presence of switching communication topologies and smooth formation changes, and ensuring the closed-loop...
Consensus seeking in multi-agent systems with an active leader and communication delays
In this paper, we consider a multi-agent consensus problem with an active leader and variable interconnection topology. The dynamics of the active leader is given in a general form of linear system. The switching interconnection topology with communication delay among the agents is taken into consideration. A neighbor-based estimator is designed for each agent to obtain the unmeasurable state variables of the dynamic leader, and then a distributed feedback control law is developed to achieve consensus....
Constant ratio-function of Lindenmayer systems
Constructing Arrangements Optimally in Parallel.
Constructing Binary Huffman Tree
Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.
Constructing canonical bases of quantized enveloping algebras.
Construction de codes indécomposables
Construction du treillis de Galois d'une relation binaire
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...
Construction d'un plus petit ordre de simplification
Construction, évaluation et amélioration systématiques de structures de données
Construction of a deterministic -automaton using derivatives