1068 search results - page 63 / 214 » Factorization as a Rank 1 Problem |
102
click to vote
TIT
2010
14 years 4 months ago
2010
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
This paper explores the use of social annotations to improve web search. Nowadays, many services, e.g. del.icio.us, have been developed for web users to organize and share their f...
151
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
175
click to vote
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider a special type of multi-label learning where class assignments of training examples are incomplete. As an example, an instance whose true class assignment is (c1, c2, ...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...