779 search results - page 41 / 156 » Algorithms for the Sample Mean of Graphs |
120
click to vote
WAW
2009
Springer
15 years 11 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
132
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
120
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
148
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a new method to estimate multiple rigid motions from noisy 3D point correspondences in the presence of outliers. The method does not require prior specification of num...
115
click to vote
WSC
2004
15 years 5 months ago
2004
We summarize the results of an experimental performance evaluation of using an empirical histogram to approximate the steady-state distribution of the underlying stochastic proces...