TSP
2008
13 years 4 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
ICDM
2006
IEEE
13 years 10 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
KDD
2009
ACM
13 years 11 months ago
2009
ACM
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...