1177 search results - page 93 / 236 » Iterative methods for Robbins problems |
109
Voted
CORR
2008
Springer
15 years 19 days ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
113
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
DCC
2004
IEEE
16 years 4 days ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
117
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
122
click to vote
CORR
2007
Springer
15 years 15 days ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...