569 search results - page 64 / 114 » Online Bounds for Bayesian Algorithms |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
100
click to vote
ILP
2005
Springer
15 years 3 months ago
2005
Springer
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
110
click to vote
MST
2002
14 years 9 months ago
2002
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...