In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas,...
— Using graph theory, this paper investigates how a group of robots, endowed with local positioning (range and bearing from other robots), can be engaged in a leaderfollowing mis...
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...