Sciweavers

10392 search results - page 2044 / 2079
» Introduction to Computer Science
Sort
View
COLT
2008
Springer
14 years 22 days ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
COLT
2008
Springer
14 years 22 days ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
14 years 22 days ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
DALT
2008
Springer
14 years 22 days ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
ELPUB
2008
ACM
14 years 22 days ago
Open Access Citation Rates and Developing Countries
Academics, having written their peer reviewed articles, may at some stage in the make their work Open Access (OA). They can do this by self-archiving an electronic version of thei...
Michael Norris, Charles Oppenheim, Fytton Rowland
« Prev « First page 2044 / 2079 Last » Next »