2694 search results - page 39 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogeneous platforms. We use the realistic one-port model with full computation/commu...
78
Voted
COLT
2005
Springer
15 years 3 months ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...