K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, whi...
In this paper, we describe the design and development of a social game called Familiars. Inspired by the daemons in Pullman’s “Dark Material” trilogy, Familiars are animal c...
Ben Kirman, Eva Ferrari, Shaun Lawson, Jonathan Fr...
Computational technologies have been increasingly explored to make biomedical knowledge and data more accessible for human understanding, comparison, analysis and communication. I...
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...