Search Results for author:
Found 3 papers, 0 papers with code
Asymmetric Leaky Private Information Retrieval
Such relaxation is relevant in applications where privacy can be traded for communication efficiency.
Latent-variable Private Information Retrieval
To prevent such information leakage, the goal of classical PIR is to hide the identity of the content/message being accessed, which subsequently also hides the latent attributes.
Near Optimal Coded Data Shuffling for Distributed Learning
Data shuffling between distributed cluster of nodes is one of the critical steps in implementing large-scale learning algorithms.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
