Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
Xiao Luo, Malcolm I. Heywood, A. Nur Zincir-Heywoo...
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
This video describes a new type of 3D curves, which generalizes the family of 2D Euler spirals. They are defined as the curves having both their curvature and their torsion evolv...