1722 search results - page 67 / 345 » On the sample mean of graphs |
84
Voted
UAI
2008
14 years 11 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...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
188
click to vote
AMW
2011
14 years 1 months ago
2011
Abstract. Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent, transform and query such data. In addition to the intrinsic challenge...
78
Voted
ECML
2005
Springer
15 years 3 months ago
2005
Springer
We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models. The induced model is seen as a lumped process of a Markov chain. It is construc...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...