723 search results - page 85 / 145 » Learning a Hidden Subgraph |
135
Voted
IJON
2011
14 years 9 months ago
2011
Restricted Boltzmann Machines (RBM) are well-studied generative models. For image data, however, standard RBMs are suboptimal, since they do not exploit the local nature of image ...
127
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
131
Voted
ALT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
116
Voted
ICMLA
2009
15 years 15 days ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
157
Voted
COMBINATORICA
2010
15 years 5 days ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...