274 search results - page 27 / 55 » On Random Sampling over Joins |
ESORICS
2002
Springer
16 years 1 months ago
2002
Springer
It is believed that masking is an effective countermeasure against power analysis attacks: before a certain operation involving a key is performed in a cryptographic chip, the inpu...
100
Voted
ICECCS
2002
IEEE
15 years 6 months ago
2002
IEEE
This paper presents an approach for generating test data for unit-level, and possibly integration-level, testing based on sampling over intervals of the input probability distribu...
165
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
138
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
114
click to vote
PROMISE
2010
14 years 8 months ago
2010
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...