Sciweavers

1189 search results - page 22 / 238
» Information Concealing Games
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 6 months ago
Secret-key Agreement with Channel State Information at the Transmitter
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a disc...
Ashish Khisti, Suhas N. Diggavi, Gregory W. Wornel...
MIPS
2004
Springer
108views Multimedia» more  MIPS 2004»
14 years 3 months ago
Residual Motion Coding Method for Error Resilient Transcoding System
Abstract. For video adaptation in universal multimedia access systems, video contents have to be transcoded according to the requirements of network bandwidth and the performance o...
June-Sok Lee, Goo-Rak Kwon, Jae-Won Kim, Kyung-Hoo...
IJSNET
2006
106views more  IJSNET 2006»
13 years 10 months ago
Efficient anonymity schemes for clustered wireless sensor networks
: In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS...
Satyajayant Misra, Guoliang Xue
TARK
2007
Springer
14 years 4 months ago
Robust equilibria under non-common priors
This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete ...
Daisuke Oyama, Olivier Tercieux
AAAI
2010
13 years 11 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...