Sciweavers

700 search results - page 113 / 140
» et 2008
Sort
View
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
13 years 9 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
ATAL
2008
Springer
13 years 9 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings
ATAL
2008
Springer
13 years 9 months ago
Nonuniform bribery
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
Piotr Faliszewski
ATVA
2008
Springer
104views Hardware» more  ATVA 2008»
13 years 9 months ago
A Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
Jefferson O. Andrade, Yukiyoshi Kameyama
CHES
2008
Springer
260views Cryptology» more  CHES 2008»
13 years 9 months ago
Mutual Information Analysis
We propose a generic information-theoretic distinguisher for differential side-channel analysis. Our model of side-channel leakage is a refinement of the one given by Standaert et ...
Benedikt Gierlichs, Lejla Batina, Pim Tuyls, Bart ...