876 search results - page 60 / 176 » Limits on the Usefulness of Random Oracles |
93
Voted
IWOCA
2009
Springer
15 years 7 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...
98
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— Data gathering is one of the most important services provided by wireless sensor networks (WSNs). Since the predominant traffic pattern in data gathering services is m...
VLDB
1992
ACM
15 years 4 months ago
1992
ACM
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
101
click to vote
SIAMREV
2010
14 years 7 months ago
2010
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
104
click to vote
EUROCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...