Sciweavers

1203 search results - page 40 / 241
» Probabilistic Matrix Factorization
Sort
View
CVPR
2008
IEEE
14 years 11 months ago
Spectrally optimal factorization of incomplete matrices
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
ICA
2010
Springer
13 years 10 months ago
Non-negative Hidden Markov Modeling of Audio with Application to Source Separation
Abstract. In recent years, there has been a great deal of work in modeling audio using non-negative matrix factorization and its probabilistic counterparts as they yield rich model...
Gautham J. Mysore, Paris Smaragdis, Bhiksha Raj
LATIN
2010
Springer
14 years 4 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
WACV
2005
IEEE
14 years 3 months ago
A Factorization Method for Structure from Planar Motion
We propose a factorization method for structure from planar motion using a stationary perspective camera. Compared with [8] for general motion, our work has three major difference...
Jian Li, Rama Chellappa
ISCAS
2007
IEEE
106views Hardware» more  ISCAS 2007»
14 years 4 months ago
Ensemble Dependent Matrix Methodology for Probabilistic-Based Fault-tolerant Nanoscale Circuit Design
—Two probabilistic-based models, namely the Ensemble-Dependent Matrix model [1][3] and the Markov Random Field model [2], have been proposed to deal with faults in nanoscale syst...
Huifei Rao, Jie Chen, Changhong Yu, Woon Tiong Ang...