Sciweavers

112 search results - page 11 / 23
» Distributed anonymous discrete function computation
Sort
View
TARK
2005
Springer
14 years 6 days ago
Unconditional privacy in social choice
The aggregation of conflicting preferences is an important issue in human society and multiagent systems. Due to its universality, voting among a set of alternatives has a centra...
Felix Brandt, Tuomas Sandholm
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 6 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
NCA
2005
IEEE
14 years 9 days ago
Using Residual Times to Meet Deadlines in M/G/C Queues
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...
ASIACRYPT
2001
Springer
13 years 10 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 20 days ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan