Sciweavers

13457 search results - page 25 / 2692
» Can we elect if we cannot compare
Sort
View
AAAI
2010
13 years 9 months ago
Can Approximation Circumvent Gibbard-Satterthwaite?
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
Ariel D. Procaccia
HICSS
2009
IEEE
96views Biometrics» more  HICSS 2009»
14 years 2 months ago
Vote Selling, Voter Anonymity, and Forensic Logging of Electronic Voting Machines
Much recent work has focused on the process of auditing the results of elections. Little work has focused on auditing the e-voting systems currently in use. The facilities for doi...
Sean Peisert, Matt Bishop, Alec Yasinsac
VOTEID
2007
Springer
14 years 1 months ago
Assessing Procedural Risks and Threats in e-Voting: Challenges and an Approach
Performing a good security analysis on the design of a system is an essential step in order to guarantee a reasonable level of protection. However, different attacks and threats m...
Komminist Weldemariam, Adolfo Villafiorita, Andrea...
BMCBI
2005
147views more  BMCBI 2005»
13 years 7 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
13 years 9 months ago
How springs can help to stabilize motions of underactuated systems with weak actuators
In the field of robotics the energy spent for actuation is always an issue. It is often the case that some desired motions cannot be achieved by the robot due to limitations in act...
Uwe Mettin, Pedro X. La Hera, Leonid B. Freidovich...