We discuss Osius's [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiven...
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
The development of mobile applications has now extended from mobile network providers into the hands of ordinary people as organizations and companies encourage people to come up ...
Florence T. Balagtas-Fernandez, Max Tafelmayer, He...