2924 search results - page 441 / 585 » Lower Bounds in Distributed Computing |
164
click to vote
CSREASAM
2009
15 years 5 months ago
2009
In this paper we propose a new designated verifier signature scheme based on the threshold signature scheme presented [8] by Ghodosi and Pieprzyk. The advantages of the new scheme ...
146
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
138
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being ...
164
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
148
click to vote
PKDD
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...