Sciweavers

687 search results - page 36 / 138
» On The Complexity of Manipulating Elections
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
HICSS
2008
IEEE
106views Biometrics» more  HICSS 2008»
14 years 2 months ago
Of Paper Trails and Voter Receipts
The Internet pervades virtually every aspect of our daily lives, and it seems there is no area that is immune from computing solutions. Computers can do things faster, with greate...
Alec Yasinsac, Matt Bishop
ACSC
2005
IEEE
14 years 1 months ago
The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...
Pablo Moscato, Luke Mathieson, Alexandre Mendes, R...
BROADNETS
2005
IEEE
14 years 1 months ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin
MMMACNS
2001
Springer
14 years 11 days ago
Generalized Oblivious Transfer Protocols Based on Noisy Channels
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
Valeri Korjik, Kirill Morozov