Sciweavers

407 search results - page 12 / 82
» The Optimal Online Algorithms for Minimizing Maximum Latenes...
Sort
View
NIPS
2004
14 years 10 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
ECCC
2006
218views more  ECCC 2006»
14 years 9 months ago
Efficient Algorithms for Online Game Playing and Universal Portfolio Management
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
Amit Agarwal, Elad Hazan
89
Voted
ICDAR
2011
IEEE
13 years 9 months ago
Objective Function Design for MCE-Based Combination of On-line and Off-line Character Recognizers for On-line Handwritten Japane
—This paper describes effective object function design for combining on-line and off-line character recognizers for on-line handwritten Japanese text recognition. We combine on-l...
Bilan Zhu, Jinfeng Gao, Masaki Nakagawa
VLSISP
2002
112views more  VLSISP 2002»
14 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
80
Voted
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
15 years 2 months ago
On-Line Windows Scheduling of Temporary Items
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
Wun-Tat Chan, Prudence W. H. Wong