138 search results - page 4 / 28 » Graph Laplacians and their convergence on random neighborhoo... |
JMLR
2011
13 years 1 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
ICRA
2002
IEEE
13 years 11 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
CPC
2000
13 years 6 months ago
2000
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...