28 search results - page 6 / 6 » colt 2003 |
109
Voted
COLT
2005
Springer
15 years 5 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
90
Voted
JCSS
2006
15 years 3 days ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
ML
2008
ACM
15 years 2 days ago
2008
ACM
Let f be a function on Rd that is monotonic in every variable. There are 2d possible assignments to the directions of monotonicity (two per variable). We provide sufficient condit...