1538 search results - page 268 / 308 » Relative Randomness and Cardinality |
102
click to vote
TCC
2009
Springer
15 years 10 months ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
115
click to vote
KDD
2003
ACM
15 years 10 months ago
2003
ACM
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...