4110 search results - page 263 / 822 » Efficient algorithms for the 2-gathering problem |
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
176
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
144
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
As the technology progresses, interconnect delays have become bottlenecks of chip performance. Three dimensional (3D) integrated circuits are proposed as one way to address this p...
177
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
202
click to vote
JMLR
2010
15 years 1 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...