Sciweavers

2269 search results - page 445 / 454
» Query Incentive Networks
Sort
View
ASIACRYPT
2004
Springer
14 years 1 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
DEXA
2004
Springer
98views Database» more  DEXA 2004»
14 years 1 months ago
On Improving the Performance Dependability of Unstructured P2P Systems via Replication
Abstract. The ever-increasing popularity of peer-to-peer (P2P) systems provides a strong motivation for designing a dependable P2P system. Dependability in P2P systems can be viewe...
Anirban Mondal, Yi Lifu, Masaru Kitsuregawa
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 21 days ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff