Sciweavers

1206 search results - page 26 / 242
» Convergence analysis of online algorithms
Sort
View
NIPS
2004
13 years 9 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
COLT
2008
Springer
13 years 10 months ago
Linear Algorithms for Online Multitask Classification
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
Giovanni Cavallanti, Nicolò Cesa-Bianchi, C...
ICDAR
2005
IEEE
14 years 2 months ago
A Two-stage Online Handwritten Chinese Character Segmentation Algorithm Based on Dynamic Programming
In this paper, an online handwritten Chinese character segmentation method is proposed. It is based on a dynamic programming algorithm, which uses geometrical features extracted f...
Xue Gao, Pierre Michel Lallican, Christian Viard-G...
SIGECOM
2004
ACM
254views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Competitive algorithms for VWAP and limit order trading
We introduce new online models for two important aspects of modern financial markets: Volume Weighted Average Price trading and limit order books. We provide an extensive study o...
Sham Kakade, Michael J. Kearns, Yishay Mansour, Lu...
TC
2008
13 years 8 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas