Sciweavers

1068 search results - page 4 / 214
» Factorization as a Rank 1 Problem
Sort
View
CVPR
2005
IEEE
14 years 11 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
LICS
2006
IEEE
14 years 3 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
WAIM
2009
Springer
14 years 2 months ago
IRank: A Term-Based Innovation Ranking System for Conferences and Scholars
Since the proposition of Journal Impact Factor [1] in 1963, the classical citation-based ranking scheme has been a standard criterion to rank journals and conferences. However, the...
Zhixu Li, Xiaoyong Du, Hongyan Liu, Jun He, Xiaofa...
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 4 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
WWW
2005
ACM
14 years 10 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna