5153 search results - page 249 / 1031 » Introduction to Randomized Algorithms |
139
Voted
CHES
1999
Springer
15 years 7 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
132
click to vote
BROADNETS
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
134
Voted
GRC
2008
IEEE
15 years 4 months ago
2008
IEEE
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
129
Voted
WWW
2010
ACM
15 years 3 months ago
2010
ACM
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...
152
Voted
IJCV
2008
15 years 3 months ago
2008
Systems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the s...