Sciweavers

5329 search results - page 9 / 1066
» The Weighted Majority Algorithm
Sort
View
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
13 years 7 months ago
On Bayes Methods for On-Line Boolean Prediction
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
AI
1998
Springer
13 years 7 months ago
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Tom Bylander
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 8 months ago
Approximate majorization and fair online load balancing
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 ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
ICPR
2006
IEEE
14 years 8 months ago
3D Object Digitization: Majority Interpolation and Marching Cubes
In a previous paper [1] we showed that a 3D object can be digitized without changing the topology if the object is r-regular and if the reconstruction method fulfills certain requ...
Peer Stelldinger, Longin Jan Latecki
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
14 years 1 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat