Sciweavers

477 search results - page 33 / 96
» Algorithms for Non-negative Matrix Factorization
Sort
View
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
14 years 2 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
IEEEMSP
2002
IEEE
14 years 19 days ago
Factorization with missing data for 3D structure recovery
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
COLT
2007
Springer
14 years 1 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
TOMS
2008
120views more  TOMS 2008»
13 years 7 months ago
Families of algorithms related to the inversion of a Symmetric Positive Definite matrix
We present families of algorithms for operations related to the computation of the inverse of a Symmetric Positive Definite (SPD) matrix: Cholesky factorization, inversion of a tr...
Paolo Bientinesi, Brian C. Gunter, Robert A. van d...
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
13 years 12 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson