3422 search results - page 663 / 685 » Random Subset Optimization |
94
Voted
CRYPTO
2004
Springer
15 years 7 months ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
136
Voted
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
149
Voted
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
126
click to vote
IPSN
2004
Springer
15 years 7 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
96
Voted
CCGRID
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...