3257 search results - page 37 / 652 » Some Results on Effective Randomness |
IWOCA
2009
Springer
14 years 4 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routi...
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
This paper presents a new kernel method for appearance-based object recognition, highly robust to noise and occlusion. It consists of a fully connected Markov Random Field that in...
ICSEA
2007
IEEE
14 years 4 months ago
2007
IEEE
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
SACRYPT
2004
Springer
14 years 3 months ago
2004
Springer
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...