Sciweavers

1203 search results - page 54 / 241
» Probabilistic Matrix Factorization
Sort
View
AAECC
2010
Springer
136views Algorithms» more  AAECC 2010»
13 years 9 months ago
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
Grégoire Lecerf
ENTCS
2006
273views more  ENTCS 2006»
13 years 9 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
MP
2008
80views more  MP 2008»
13 years 9 months ago
Modified Cholesky algorithms: a catalog with new approaches
Given an n
Haw-ren Fang, Dianne P. O'Leary
CVPR
2011
IEEE
13 years 6 months ago
Non-Rigid Structure from Motion with Complementary Rank-3 Spaces
Non-rigid structure from motion (NR-SFM) is a difficult, underconstrained problem in computer vision. This paper proposes a new algorithm that revises the standard matrix factori...
Paulo Gotardo, Aleix Martinez
ICCV
2005
IEEE
14 years 11 months ago
Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the pas...
Tamir Hazan, Simon Polak, Amnon Shashua