The paper introduces a new method of planning paths for crowds in dynamic environment represented by a graph of vertices and edges, where the edge weight as well as the graph topology may change, but the method is also applicable to environment with a different representa...

In this paper we extend Skip-Gram and Continuous Bag-of-Words Distributional word representations models via global context information. We use a corpus extracted from Wikipedia, where articles are organized in a hierarchy of categories. These categories provide useful topical information about e...

Convexity in a network (graph) has been recently defined as a property of each of its subgraphs to include all shortest paths between the nodes of that subgraph. It can be measured on the scale [0, 1] with 1 being assigned to fully convex networks. The largest c...

This paper illustrates the development and the applicability of an Evolutionary Computation approach to enhance the treatment of Type-1 diabetic patients that necessitate insulin injections. In fact, being such a disease associated to a malfunctioning pancreas that generates an insufficient amoun...

Many Automatic face recognition (AFR) methods achieve a high recognition accuracy when the environment is well-controlled. In the case of moderately controlled or fully uncontrolled environments however, the performance of most techniques is dramatically reduced. As a result, the provision of...