Sciweavers

111 search results - page 23 / 23
» Perspectives on Sparse Bayesian Learning
Sort
View
104
Voted
COLT
2005
Springer
15 years 5 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon