2163 search results - page 253 / 433 » cases 2004 |
157
click to vote
SPAA
2004
ACM
16 years 1 days ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
168
click to vote
SPAA
2004
ACM
16 years 1 days ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
237
click to vote
CP
2004
Springer
16 years 6 hour ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
157
Voted
CRYPTO
2004
Springer
16 years 5 hour ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
168
click to vote
EWSN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...