569 search results - page 17 / 114 » Online Bounds for Bayesian Algorithms |
NIPS
2008
14 years 11 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
ALGORITHMICA
2010
14 years 10 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
JAIR
2007
14 years 9 months ago
2007
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...