This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
We outline the computation of an explicit formula for the Hilbert function of the ladder determinantal varieties defined by the vanishing of all minors of a fixed size of a rectang...
Simulated tempering (ST) is an established Markov Chain Monte Carlo (MCMC) methodology for sampling from a multimodal density π(θ). The technique involves introducing an auxilia...
Most of the existing approaches to collaborative filtering cannot handle very large data sets. In this paper we show how a class of two-layer undirected graphical models, called R...
Ruslan Salakhutdinov, Andriy Mnih, Geoffrey E. Hin...