1518 search results - page 108 / 304 » Cryptographic Test Correction |
138
Voted
ASIACRYPT
2010
Springer
15 years 1 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
142
Voted
JOC
2011
14 years 6 months ago
2011
Physical random number generators (a.k.a. TRNGs) appear to be critical components of many cryptographic systems. Yet, such building blocks are still too seldom provided with a form...
153
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
151
Voted
LLL
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
143
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
In a data streaming setting, data points are observed one by one. The concepts to be learned from the data points may change infinitely often as the data is streaming. In this pap...