1722 search results - page 109 / 345 » On the sample mean of graphs |
157
click to vote
TCS
2010
15 years 4 months ago
2010
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
146
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
163
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
194
click to vote
KAIS
2011
15 years 1 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
205
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
We study the problem of the reconstruction of a Gaussian field defined in [0, 1] using N sensors deployed at regular intervals. The goal is to quantify the total data rate require...