Sciweavers

1722 search results - page 67 / 345
» On the sample mean of graphs
Sort
View
104
Voted
UAI
2008
15 years 2 months ago
Bayesian Out-Trees
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...
Tony Jebara
79
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
Changing Labels in the Double-Pushout Approach Can Be Treated Categorically
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...
Hans Jürgen Schneider
215
Voted
AMW
2011
14 years 4 months ago
SNQL: A Social Networks Query and Transformation Language
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...
Mauro San Martín, Claudio Gutierrez, Peter ...
ECML
2005
Springer
15 years 6 months ago
Inducing Hidden Markov Models to Model Long-Term Dependencies
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...
Jérôme Callut, Pierre Dupont
94
Voted
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 6 months ago
Implementing Huge Sparse Random Graphs
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...
Moni Naor, Asaf Nussboim