Sciweavers

358 search results - page 60 / 72
» Rank Matrix Factorisation
Sort
View
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
13 years 10 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
15 years 11 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
FOCS
2007
IEEE
15 years 5 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
CONTEXT
2007
Springer
15 years 4 months ago
Discovering Hidden Contextual Factors for Implicit Feedback
Abstract. This paper presents a statistical framework based on Principal Component Analysis (PCA) for discovering the contextual factors which most strongly influence user behavio...
Massimo Melucci, Ryen W. White
ECCV
2006
Springer
15 years 2 months ago
A Batch Algorithm for Implicit Non-rigid Shape and Motion Recovery
The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists ...
Adrien Bartoli, Søren I. Olsen