779 search results - page 39 / 156 » Algorithms for the Sample Mean of Graphs |
130
Voted
GD
2005
Springer
15 years 9 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
154
click to vote
PVLDB
2010
15 years 2 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
124
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivatedâ€...
151
click to vote
UAI
2008
15 years 5 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
125
click to vote
DAC
1993
ACM
15 years 8 months ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...