2714 search results - page 280 / 543 » Approximation Schemes for Scheduling |
130
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
113
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
135
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
179
click to vote
PCI
2001
Springer
15 years 8 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
138
Voted
IJCAI
2007
15 years 5 months ago
2007
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory informatio...