Sciweavers

766 search results - page 40 / 154
» Online Variance Minimization
Sort
View
INFOCOM
2002
IEEE
15 years 4 months ago
Optimal on-line estimation of the size of a dynamic multicast group
Abstract—In this paper we propose an efficient on-line estimation algorithm for determining the size of a dynamic multicast group. By using diffusion approximation and Kalman ...
Sara Alouf, Eitan Altman, Philippe Nain
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
15 years 3 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
NECO
2008
112views more  NECO 2008»
14 years 11 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
DSD
2008
IEEE
115views Hardware» more  DSD 2008»
15 years 6 months ago
An Efficient Multiple-Parity Generator Design for On-Line Testing on FPGA
We propose a method to efficiently design a “parity generator”, which is a stand-alone block producing multiple parity bits of a given circuit. The parity generator is designe...
Petr Fiser, Pavel Kubalík, Hana Kubatova
ICDAR
2007
IEEE
15 years 6 months ago
Minimum Error Discriminative Training for Radical-Based Online Chinese Handwriting Recognition
Free style Chinese handwriting recognition continues to pose a challenge to researchers due to the variety of Chinese writing styles. To recognize handwritten characters in an onl...
Y. Zhang, P. Liu, F. Soong