Sciweavers

776 search results - page 11 / 156
» Distributed Information Regularization on Graphs
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
Local Regularized Least-Square Dimensionality Reduction
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...
Changshui Zhang, Yangqing Jia
AINA
2007
IEEE
15 years 6 months ago
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
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...
Zhuo Miao, Dan C. Stefanescu, Alex Thomo
ICALP
2007
Springer
15 years 4 months ago
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
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,...
ICRA
2010
IEEE
185views Robotics» more  ICRA 2010»
14 years 11 months ago
Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missio
— 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...
Riccardo Falconi, Sven Gowal, Alcherio Martinoli
SIROCCO
2000
15 years 1 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: 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...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...