346 search results - page 3 / 70 » The Secret Santa Problem |
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...
ICMCS
2007
IEEE
13 years 12 months ago
2007
IEEE
Some (k, n)-threshold image secret sharing schemes encrypt the secret image into n noise-like shadow images with size 1/k times that of the original secret image. The small size o...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
QEST
2008
IEEE
13 years 12 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...