Sciweavers

3422 search results - page 359 / 685
» Random Subset Optimization
Sort
View
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 10 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
LCN
2006
IEEE
15 years 10 months ago
Bandwidth Aware Slot Allocation in Hybrid MAC
— Hybrid Medium Access Control (MAC) protocols combine the strength of random and schedule based MAC schemes. From random MAC schemes, Hybrid MAC protocols borrow flexibility an...
Yuvraj. K. Rana, Bao Hua Liu, Alfandika Nyandoro, ...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
15 years 10 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan
PKC
1999
Springer
102views Cryptology» more  PKC 1999»
15 years 8 months ago
How to Enhance the Security of Public-Key Encryption at Minimum Cost
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
Eiichiro Fujisaki, Tatsuaki Okamoto