3049 search results - page 372 / 610 » On the Convergence of Bound Optimization Algorithms |
181
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
193
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
150
click to vote
NIPS
2007
15 years 8 months ago
2007
We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
154
click to vote
COR
2008
15 years 6 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
156
click to vote
NETWORKS
2010
15 years 5 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...