779 search results - page 3 / 156 » Algorithms for the Sample Mean of Graphs |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
ENDM
2000
13 years 5 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
UAI
2004
13 years 6 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
GD
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
TSP
2008
13 years 5 months ago
2008
The combination of the famed kernel trick and the least-mean-square (LMS) algorithm provides an interesting sample by sample update for an adaptive filter in reproducing Kernel Hil...