116 search results - page 7 / 24 » Anonymity-Proof Voting Rules |
AAAI
2007
13 years 9 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
Multiple Species Weighted Voting (MSWV) is a genetics-based machine learning (GBML) system with relatively few parameters that combines N two-class classifiers into an N -class cla...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
This paper describes techniques for fusing the output of multiple cues to robustly and accurately segment foreground objects from the background in image sequences. Two different m...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
AAAI
2010
13 years 9 months ago
2010
The concept of distance rationalizability allows one to define new voting rules or "rationalize" existing ones via a consensus class of elections and a distance. A conse...