Sciweavers

723 search results - page 85 / 145
» Learning a Hidden Subgraph
Sort
View
IJON
2011
169views more  IJON 2011»
13 years 3 months ago
Exploiting local structure in Boltzmann machines
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 ...
Hannes Schulz, Andreas Müller 0004, Sven Behn...
ICML
2009
IEEE
14 years 9 months ago
Bandit-based optimization on graphs with application to library performance tuning
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...
Arpad Rimmel, Frédéric de Mesmay, Ma...
ALT
2010
Springer
13 years 10 months ago
Inferring Social Networks from Outbreaks
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 ...
Dana Angluin, James Aspnes, Lev Reyzin
ICMLA
2009
13 years 6 months ago
Exact Graph Structure Estimation with Degree Priors
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...
Bert Huang, Tony Jebara
COMBINATORICA
2010
13 years 6 months ago
A randomized embedding algorithm for trees
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 ...
Benny Sudakov, Jan Vondrák