485 search results - page 50 / 97 » Iterative Bounding LAO |
94
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
103
click to vote
MP
2008
15 years 16 days ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
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...
106
click to vote
IEEEPACT
1998
IEEE
15 years 4 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
129
Voted
ASPLOS
1992
ACM
15 years 4 months ago
1992
ACM
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a ...