[EM] Fast algorithms for Yee/Bolson pictures

[raphfrk at netscape.net]

 So the steps would be:
 
 a) work out the ballot for a voter at each pixel
 
 b) convert result into 2-d frequency domain 
  
 c) work out the density function (Gaussian)
 
 d) convert density function to the frequency domain
 
 e) multiply d) by b)
 <this is equivalent to convolution in the 'time' domain>
 
 f) apply reverse 2-d FFT
 
 Each pixel now contains the result for the vote centred on that pixel.
 
 Repeat for each candidate.
 
 This above works for methods which just total the votes.
 
 Condorcet could be done by generating the C*C grid.
 
 For any other type of vote, you consider each possible ballot a candidate.
 
 In practice all possible ballots would not be used.
 
 Noise could also be added by playing around with the density function rather 
 than after the convolution. This would be more accurate noise. In fact, 
 the density function could be recomputed for each election.
 
  Raphfrk
 --------------------
 Interesting site
 "what if anyone could modify the laws"
 
 www.wikocracy.com   
   
________________________________________________________________________
Check Out the new free AIM(R) Mail -- 2 GB of storage and industry-leading spam and email virus protection.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20061219/690d6735/attachment-0003.htm>