Oblivious tight compaction in O(n) time with smaller constant.

Samuel Dittmer Rafail Ostrovsky

Published in: IACR Cryptol. ePrint Arch. (2020)

Keyphrases

lower bound
worst case
upper bound
database
data sets
neural network
image processing
decision trees
case study
objective function
object recognition
np hard
constant velocity
slightly higher