7930 search results - page 702 / 1586 » Greedy in Approximation Algorithms |
228
click to vote
JMLR
2010
15 years 2 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
245
click to vote
CVPR
2012
IEEE
13 years 10 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
311
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
206
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
223
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...