1068 search results - page 7 / 214 » Factorization as a Rank 1 Problem |
WWW
2005
ACM
15 years 10 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
SIGSOFT
2004
ACM
15 years 3 months ago
2004
ACM
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
MP
2007
14 years 9 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
155
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...