Counting abelian squares.
Counting bordered partial words by critical positions.
Counting equivalence classes of irreducible representations.
Counting Facets and Incidences.
Counting occurrences of some subword patterns.
Counting ordered patterns in words generated by morphisms.
Counting subwords in a partition of a set.
Counting Triangle Crossings and Halving Planes.
Counting words by number of occurrences of some patterns.
Covering a disk by disks.
Covering space theory for directed topology.
Covering with rectangular pieces.
Critical exponents of words over 3 letters.
Croisements, ordres et ultramétriques
La représentation visuelle d'une hiérarchie induit un ordre sur les singletons. Si l'on désire représenter la même hiérarchie en tenant compte de contraintes extérieures (ordre des singletons induit par une autre hiérarchie, une partition, un indice de dissimilarité, par exemple) des croisements peuvent apparaître. Il y a un croisement dans la représentation visuelle d'une hiérarchie quand une branche horizontale (associée à un palier) est coupée par une branche verticale associée à un singleton....
Crossing-bounded computations and their relation to the LBA-problem
Cross-task code reuse in genetic programming applied to visual learning
We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a code reuse mechanism by introducing a crossbreeding operator that allows importing the genetic material from...
Cryptography through Interpolation, Approximation and Computational Intelligence methods
Cryptographycal protocols in the Egerfood Information System.
Čtvrtá spojená mezinárodní konference o umělém intelektu
Cubical approximation and computation of homology
The purpose of this article is to introduce a method for computing the homology groups of cellular complexes composed of cubes. We will pay attention to issues of storage and efficiency in performing computations on large complexes which will be required in applications to the computation of the Conley index. The algorithm used in the homology computations is based on a local reduction procedure, and we give a subquadratic estimate of its computational complexity. This estimate is rigorous in two...