6251 search results - page 1071 / 1251 » Randomness, Computability, and Density |
164
click to vote
AUSAI
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
164
click to vote
CCS
2003
ACM
15 years 9 months ago
2003
ACM
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. Ho...
109
click to vote
CCS
2003
ACM
15 years 9 months ago
2003
ACM
We present a novel solution for authenticating printed paper documents by utilizing the inherent non–repeatable randomness existing in the printing process. For a document print...
116
click to vote
DAGM
2003
Springer
15 years 9 months ago
2003
Springer
A new enhancement of RANSAC, the locally optimized RANSAC (LO-RANSAC), is introduced. It has been observed that, to find an optimal solution (with a given probability), the numbe...
130
click to vote
EUROCRYPT
2003
Springer
15 years 9 months ago
2003
Springer
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious concern. Forward security allows one to mitigate the...