Sciweavers

6615 search results - page 374 / 1323
» Indexing Multiple Sets
Sort
View
CGF
2010
99views more  CGF 2010»
15 years 7 months ago
Trivial Connections on Discrete Surfaces
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 ...
Keenan Crane, Mathieu Desbrun, Peter Schröder
EJC
2010
15 years 6 months ago
The flipping puzzle on a graph
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...
Hau-wen Huang, Chih-wen Weng
DM
2002
82views more  DM 2002»
15 years 6 months ago
Hilbert functions of ladder determinantal varieties
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...
Sudhir R. Ghorpade
SAC
2010
ACM
15 years 5 months ago
Importance tempering
Simulated tempering (ST) is an established Markov Chain Monte Carlo (MCMC) methodology for sampling from a multimodal density π(θ). The technique involves introducing an auxilia...
Robert B. Gramacy, Richard Samworth, Ruth King
ICML
2007
IEEE
16 years 7 months ago
Restricted Boltzmann machines for collaborative filtering
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...