3 search results - page 1 / 1 » A Fast Cutting-Plane Algorithm for Optimal Coalescing |
CC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
SIAMJO
2010
12 years 11 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...