Sciweavers

6142 search results - page 360 / 1229
» The Complexity of Partition Functions
Sort
View
3DPVT
2006
IEEE
169views Visualization» more  3DPVT 2006»
16 years 23 days ago
Angle Independent Bundle Adjustment Refinement
Obtaining a digital model of a real-world 3D scene is a challenging task pursued by computer vision and computer graphics. Given an initial approximate 3D model, a popular refinem...
Jeffrey Zhang, Daniel G. Aliaga, Mireille Boutin, ...
NIPS
2008
15 years 8 months ago
Implicit Mixtures of Restricted Boltzmann Machines
We present a mixture model whose components are Restricted Boltzmann Machines (RBMs). This possibility has not been considered before because computing the partition function of a...
Vinod Nair, Geoffrey E. Hinton
DM
2008
69views more  DM 2008»
15 years 6 months ago
New identities for 7-cores with prescribed BG-rank
Let be a partition. BG-rank() is defined as an alternating sum of parities of parts of [1]. In [2], Berkovich and Garvan found theta series representations for the t-core generat...
Alexander Berkovich, Hamza Yesilyurt
PC
2007
133views Management» more  PC 2007»
15 years 6 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy
SIAMDM
2010
84views more  SIAMDM 2010»
15 years 5 months ago
Complementary Iterated Floor Words and the Flora Game
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
Aviezri S. Fraenkel