2694 search results - page 50 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...