Sciweavers

5329 search results - page 4 / 1066
» The Weighted Majority Algorithm
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...
Anne Canteaut, Michaël Trabbia
ATAL
2003
Springer
14 years 21 days ago
Detecting deception in reputation management
We previously developed a social mechanism for distributed reputation management, in which an agent combines testimonies from several witnesses to determine its ratings of another...
Bin Yu, Munindar P. Singh
AAAI
1997
13 years 8 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
SIGIR
2002
ACM
13 years 7 months ago
Study of category score algorithms for k-NN classifier
: This paper analyzes category score algorithms for k-NN classifier found in the literature, including majority voting algorithm (MVA), simple sum algorithm (SSA), etc. MVA and SS...
Huaizhong Kou, Georges Gardarin
COLT
1999
Springer
13 years 11 months ago
An Adaptive Version of the Boost by Majority Algorithm
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
Yoav Freund