1068 search results - page 45 / 214 » Factorization as a Rank 1 Problem |
126
click to vote
IBPRIA
2009
Springer
15 years 6 months ago
2009
Springer
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
130
click to vote
BMCBI
2004
15 years 1 months ago
2004
Background: Within the peer-reviewed literature, associations between two things are not always recognized until commonalities between them become apparent. These commonalities ca...
209
click to vote
SIAMJO
2011
14 years 9 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
122
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
122
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...