Sciweavers

764 search results - page 46 / 153
» Maximum-Margin Matrix Factorization
Sort
View
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
14 years 9 months ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo
COLT
2007
Springer
15 years 4 months ago
Learning Permutations with Exponential Weights
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
David P. Helmbold, Manfred K. Warmuth
MP
2008
80views more  MP 2008»
14 years 10 months ago
Modified Cholesky algorithms: a catalog with new approaches
Given an n
Haw-ren Fang, Dianne P. O'Leary
CVPR
2011
IEEE
14 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
15 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