research
∙
08/15/2023
Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions
Encoding data as a set of unordered strings is receiving great attention...
share
research
∙
08/14/2023
Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex Hulls
Hierarchical and tree-like data sets arise in many applications, includi...
research
∙
05/09/2023
On the Information Capacity of Nearest Neighbor Representations
The von Neumann Computer Architecture has a distinction between computat...
research
∙
04/03/2023
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing
Motivated by testing for pathogenic diseases we consider a new nonadapti...
research
∙
03/23/2023
Perturbation-Resilient Sets for Dynamic Service Balancing
Balanced and swap-robust minimal trades, introduced in [1], are importan...
research
∙
03/23/2023
On Constant-Weight Binary B_2-Sequences
Motivated by applications in polymer-based data storage we introduced th...
research
∙
10/28/2022
Machine Unlearning of Federated Clusters
Federated clustering is an unsupervised learning problem that arises in ...
research
∙
10/21/2022
Non-binary Codes for Correcting a Burst of at Most t Deletions
The problem of correcting deletions has received significant attention, ...
research
∙
07/18/2022
Correcting k Deletions and Insertions in Racetrack Memory
One of the main challenges in developing racetrack memory systems is the...
research
∙
05/17/2022
On Algebraic Constructions of Neural Networks with Small Weights
Neural gates compute functions based on weighted sums of the input varia...
research
∙
02/10/2021
Trace Reconstruction with Bounded Edit Distance
The trace reconstruction problem studies the number of noisy samples nee...
research
∙
10/27/2019
Optimal k-Deletion Correcting Codes
Levenshtein introduced the problem of constructing k-deletion correcting...
research
∙
09/07/2018
On Coding over Sliced Information
The interest in channel models in which the data is sent as an unordered...
research
∙
06/25/2018
