1068 search results - page 15 / 214 » Factorization as a Rank 1 Problem |
133
click to vote
WSDM
2010
ACM
15 years 11 months ago
2010
ACM
Tagging plays an important role in many recent websites. Recommender systems can help to suggest a user the tags he might want to use for tagging a specific item. Factorization mo...
GI
2007
Springer
15 years 8 months ago
2007
Springer
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
125
click to vote
SIGIR
2006
ACM
15 years 7 months ago
2006
ACM
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must ...
100
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
105
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...